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

Single column discrepancy and dynamic max-mini optimizations for quickly finding the most parsimonious evolutionary

P W Purdom1, P G Bradford, K Tamura

  • 1Computer Science Department, Indiana University, Bloomington 47405-4101, USA.

Bioinformatics (Oxford, England)
|June 8, 2000
PubMed
Summary

This study introduces a new heuristic for maximum parsimony (MP) tree searches, significantly speeding up evolutionary relationship analysis. The dynamic Max-mini order and single column discrepancy heuristic improve computational efficiency, especially for larger datasets.

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

Escherichia coli tRNA(Asp) recognition mechanism differing from that of the yeast system.

Biochemical and biophysical research communications·1992
Same author

Toxic effects of oxygen-derived free radicals on rat pancreatic acini; an in vitro study.

Hepato-gastroenterology·1992
Same author

[A 52-week oral chronic toxicity study of 6-amidino-2-naphthyl 4-[(4,5-dihydro-1H-imidazol-2-yl)amino] benzoate dimethanesulfonate (FUT-187) in rats with a recovery period of 5 weeks.

The Journal of toxicological sciences·1992
Same author

[A 13-week subacute oral toxicity study of 6-amidino-2-naphthyl 4-[(4,5-dihydro-1H-imidazol-2-yl) amino] benzoate dimethanesulfonate (FUT-187) in rats].

The Journal of toxicological sciences·1992
Same author

Mixed connective tissue disease associated with protein losing enteropathy: successful treatment with intravenous cyclophosphamide therapy.

Internal medicine (Tokyo, Japan)·1992
Same author

Localized, aggregative, and diffuse adherence to HeLa cells, plastic, and human small intestines by Escherichia coli isolated from patients with diarrhea.

The Journal of infectious diseases·1992

Area of Science:

  • Computational Biology
  • Phylogenetics
  • Evolutionary Biology

Background:

  • Maximum parsimony (MP) is a key method for inferring evolutionary relationships from sequence data.
  • The branch-and-bound algorithm is typically used to find the optimal MP tree, but can be computationally intensive.
  • Current methods for partial phylogenetic trees assign costs based on existing discrepancy, potentially missing future costs.

Purpose of the Study:

  • To develop a more efficient heuristic for maximum parsimony tree searches.
  • To improve the speed of phylogenetic tree construction using branch-and-bound algorithms.
  • To enhance the accuracy and speed of evolutionary relationship analysis.

Main Methods:

  • Proposed a single column discrepancy heuristic to estimate future costs in partial phylogenetic trees.

Related Experiment Videos

  • Introduced a dynamic Max-mini order for sequence addition to prune suboptimal search paths.
  • Applied these heuristics to accelerate the branch-and-bound algorithm for MP tree searches.

    • Main Results:

    • The single column discrepancy heuristic achieved a 2.4-fold speedup with static search order and an 18.2-fold speedup with dynamic search order.
    • Computational improvements were observed to increase exponentially with the number of sequences analyzed.
    • The proposed strategies demonstrated significant acceleration of MP tree search computations.

    Conclusions:

    • The developed heuristics substantially improve the efficiency of maximum parsimony tree searches.
    • These methods offer a promising approach for accelerating phylogenetic analyses, particularly for large datasets.
    • The strategies are applicable to other branch-and-bound-like algorithms used in computational biology.