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

An adaptive and iterative algorithm for refining multiple sequence alignment.

Yi Wang1, Kuo-Bin Li

  • 1Bioinformatics Institute, 30 Biopolis Street, Singapore 138671, Singapore.

Computational Biology and Chemistry
|May 8, 2004
PubMed
Summary
This summary is machine-generated.

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

Predicting Protein-Protein Interaction Sites Using Sequence Descriptors and Site Propensity of Neighboring Amino Acids.

International journal of molecular sciences·2016
Same author

Predicting membrane protein types by incorporating protein topology, domains, signal peptides, and physicochemical properties into the general form of Chou's pseudo amino acid composition.

Journal of theoretical biology·2012
Same author

Correlation of expression profiles between microRNAs and mRNA targets using NCI-60 data.

BMC genomics·2009
Same author

MiRTif: a support vector machine-based microRNA target interaction filter.

BMC bioinformatics·2008
Same author

Electrostatic funneling of substrate in mitochondrial inner membrane carriers.

Proceedings of the National Academy of Sciences of the United States of America·2008
Same author

A comprehensive analysis of the dual roles of BMPs in regulating adipogenic and osteogenic differentiation of mesenchymal progenitor cells.

Stem cells and development·2008
Same journal

Protein dynamic simulations: From early inception to clinical translation over half a century.

Computational biology and chemistry·2026
Same journal

Integrated omics and virtual screening predict Tabularin as a dual inhibitor of the prognostic microRNAs mir-19a and mir-32 in colorectal cancer.

Computational biology and chemistry·2026
Same journal

In silico characterization of acetyl-CoA carboxylase from Staphylococcus aureus and Escherichia coli: A comparative analysis.

Computational biology and chemistry·2026
Same journal

An optimized cascaded transformer with progressive attention for lung and colon cancer diagnosis from histopathological images.

Computational biology and chemistry·2026
Same journal

From cross cancer transcriptomics to therapeutics: WGX-50 target hub genes in breast cancer and non-small cell lung carcinoma.

Computational biology and chemistry·2026
Same journal

Blood-based biomarker discovery through integrative transcriptomic and miRNA network analyses in schizophrenia, major depressive disorder, and bipolar disorder.

Computational biology and chemistry·2026
See all related articles

This study introduces an iterative heuristic algorithm to enhance multiple sequence alignment by strategically placing gaps. The method refines alignments, achieving near-optimal results independent of initial conditions.

Area of Science:

  • Computational genomics
  • Bioinformatics
  • Protein sequence analysis

Background:

  • Multiple sequence alignment (MSA) is fundamental in computational genomics for understanding protein evolution and function.
  • The accuracy of MSA critically depends on optimal gap placement.
  • Existing algorithms often struggle with local optima and sensitivity to initial alignments.

Purpose of the Study:

  • To develop and evaluate a novel heuristic algorithm for iterative improvement of multiple protein sequence alignments.
  • To assess the algorithm's performance using a standard benchmark dataset.
  • To demonstrate the algorithm's ability to refine alignments from other popular software.

Main Methods:

  • An iterative heuristic approach for multiple sequence alignment optimization.

Related Experiment Videos

  • Utilizes a consistency-based objective function to guide alignment refinement.
  • Incorporates gap insertion strategies to escape local optima during iterative optimization.
  • Employs the BAliBASE benchmark alignment database for rigorous evaluation.

    • Main Results:

    • The algorithm's performance shows minimal dependence on initial or seed alignments.
    • With a perfect consistency library, alignments approach the global optimum.
    • Demonstrated ability to refine and improve alignments generated by ClustalW, SAGA, and T-COFFEE.
    • The iterative refinement process effectively preserves well-aligned regions.

    Conclusions:

    • The presented heuristic algorithm offers a robust method for improving multiple protein sequence alignments.
    • Its independence from initial conditions and ability to refine existing alignments make it a valuable tool in computational genomics.
    • The algorithm provides a pathway to achieve near-global optimal alignments, enhancing downstream biological analyses.