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

On the complexity of multiple sequence alignment

L Wang1, T Jiang

  • 1Department of Electrical and Computer Engineering, McMaster University, Hamilton, Ontario, Canada.

Journal of Computational Biology : a Journal of Computational Molecular Cell Biology
|January 1, 1994
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

Prodomain mutations at the subtilisin interface: correlation of binding energy and the rate of catalyzed folding.

Biochemistry·1995
Same author

Synthesis and characterization of a highly potent and effective antagonist of retinoic acid receptors.

Journal of medicinal chemistry·1995
Same author

Thermodynamic parameters for the helix-coil transition of oligopeptides: molecular dynamics simulation with the peptide growth method.

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

The sixty nucleotide OccR operator contains a subsite essential and sufficient for OccR binding and a second subsite required for ligand-responsive DNA bending.

Journal of molecular biology·1995
Same author

Cloning of a cDNA encoding a 190-kDa insulin receptor substrate-1-like protein of simian COS cells.

Biochemical and biophysical research communications·1995
Same author

Differences in oxidative response of subpopulations of neutrophils from healthy subjects and patients with rheumatoid arthritis.

Annals of the rheumatic diseases·1995
Same journal

GMSA: A Graph Matching and Point Cloud Registration-Based Method for Spatial Transcriptomics Data Alignment.

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

Investigations on Multiple Protein Scaffold Filling.

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

Cell Type Prediction for Single-Cell RNA Sequencing Utilizing Unsupervised Domain Adaptation and Semi-Supervised Learning.

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

PPIGAN: Prediction of Protein-Protein Interactions Using Generative Adversarial Networks.

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

Deep Structure-Enhanced Cell Clustering Model for Single-Cell RNA Sequencing Data.

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

Asymmetric Drug-Drug Interaction Prediction Based on Generative Adversarial Networks and Knowledge Graph.

Journal of computational biology : a journal of computational molecular cell biology·2026
See all related articles

The computational complexity of multiple sequence alignment problems was analyzed. Multiple alignment with SP-score is NP-complete, and multiple tree alignment is MAX SNP-hard.

Area of Science:

  • Computational Biology
  • Bioinformatics
  • Theoretical Computer Science

Background:

  • Multiple sequence alignment is crucial for understanding protein and nucleic acid evolution.
  • Assessing the computational complexity of alignment problems is essential for algorithm development.

Purpose of the Study:

  • To determine the computational complexity of multiple alignment with SP-score.
  • To analyze the complexity of multiple tree alignment.
  • To investigate tree alignment complexity with a given phylogeny.

Main Methods:

  • NP-completeness proofs for the multiple alignment with SP-score problem.
  • MAX SNP-hardness proofs for the multiple tree alignment problem.

Main Results:

Related Experiment Videos

  • The multiple alignment with SP-score problem is proven to be NP-complete.
  • The multiple tree alignment problem is shown to be MAX SNP-hard.
  • The complexity of tree alignment with a fixed phylogeny was also examined.

Conclusions:

  • These findings establish the inherent computational difficulty of key multiple sequence alignment problems.
  • Understanding these complexities guides the development of efficient approximation algorithms.