Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Experiment Videos

Randomized and parallel algorithms for distance matrix calculations in multiple sequence alignment.

Sanguthevar Rajasekaran1, Vishal Thapar, Hardik Dave

  • 1School of Computer Science and Engineering, Harvard University, Boston, MA, USA. rajasek@engr.uconn.edu

Journal of Clinical Monitoring and Computing
|December 6, 2005
PubMed
Summary

This study introduces a novel randomized algorithm for calculating distance matrices, a key step in multiple sequence alignment (MSA). The new method offers a faster, parallelizable solution for complex biological sequence alignment problems.

Related Concept Videos

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Associations between controlling nutritional status and mortality in osteoporosis: evidence from NHANES, 2005-2018.

Calcified tissue international·2026
Same author

Femoral Osteochondritis Dissecans and Tibial Osteochondral Defect in an Adult Revealed by Bone SPECT/CT.

Diagnostics (Basel, Switzerland)·2026
Same author

<i>Special Issue:</i> 13th International Conference on Computational Advances in Bio and Medical Sciences.

Journal of computational biology : a journal of computational molecular cell biology·2026
Same author

Fast Algorithms for Computing Jaro Similarity.

Journal of computational biology : a journal of computational molecular cell biology·2026
Same author

Cell Culture Substrate Variation Alters Extracellular Vesicle Biogenesis Without Affecting Non-Coding Repeat RNA Profile.

Small (Weinheim an der Bergstrasse, Germany)·2026
Same author

<i>Special Section:</i> 12th International Computational Advances in Bio and Medical Sciences (ICCABS 2023).

Journal of computational biology : a journal of computational molecular cell biology·2025

Area of Science:

  • Bioinformatics
  • Computational Biology
  • Genomics

Background:

  • Multiple sequence alignment (MSA) is crucial for biological sequence analysis.
  • Traditional MSA algorithms face computational challenges due to the NP-hard nature of the problem, limiting scalability.
  • Existing methods struggle with large datasets and high time complexity.

Purpose of the Study:

  • To present a novel randomized algorithm for computing distance matrices, essential for MSA.
  • To address the computational intractability of optimal multiple sequence alignment for large datasets.
  • To introduce a sampling-based approach for efficient distance matrix calculation.

Main Methods:

  • Developed a randomized algorithm utilizing sampling techniques for distance matrix computation.

Related Experiment Videos

  • Extended the algorithm to handle non-uniform length sequences.
  • Investigated and demonstrated the parallelizability of the proposed algorithm.

    • Main Results:

    • The randomized sampling approach significantly speeds up distance matrix calculation.
    • The algorithm demonstrates accuracy comparable to traditional methods.
    • Empirical data validates the speedup and effectiveness of the proposed parallelizable algorithm.

    Conclusions:

    • The proposed randomized algorithm offers an efficient and scalable solution for distance matrix calculation in MSA.
    • Parallelization enhances the algorithm's performance, making it suitable for large-scale biological data.
    • This work provides a significant advancement in computational methods for multiple sequence alignment.