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

Better methods for solving parsimony and compatibility

M Bonet1, M Steel, T Warnow

  • 1Universidad Politecnica de Catalunya, Department Lenguages y Sist. Informaticos, Barcelona.

Journal of Computational Biology : a Journal of Computational Molecular Cell Biology
|October 17, 1998
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

Evidence for Trace Gas Metabolism and Widespread Antibiotic Synthesis in an Abiotically Driven, Antarctic Soil Ecosystem.

Environmental microbiology reports·2025
Same author

Clinical algorithms for management of fetal heart rate abnormalities during labour.

BJOG : an international journal of obstetrics and gynaecology·2022
Same author

Constructing evidence-based clinical intrapartum care algorithms for decision-support tools.

BJOG : an international journal of obstetrics and gynaecology·2022
Same author

Characterization and Outcomes of SARS-CoV-2 Infection in Patients with Sarcoidosis.

Viruses·2021
Same author

Saving time in the radiotherapy procedures for COVID-19 pneumonia treatment. A single-institution experience.

Clinical & translational oncology : official publication of the Federation of Spanish Oncology Societies and of the National Cancer Institute of Mexico·2021
Same author

WHO next-generation partograph: revolutionary steps towards individualised labour care.

BJOG : an international journal of obstetrics and gynaecology·2021
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

This study introduces Optimal Tree Refinement for reconstructing large evolutionary trees, addressing NP-hard problems in biology and linguistics. The new technique offers polynomial time algorithms for maximum parsimony and maximum compatibility tree reconstruction.

Area of Science:

  • Computational biology
  • Phylogenetics
  • Computational linguistics

Background:

  • Evolutionary tree reconstruction is crucial in biology and linguistics.
  • Maximum parsimony (biology) and maximum compatibility (linguistics) are key methods.
  • These methods are NP-hard, requiring lengthy heuristic searches for large datasets.

Purpose of the Study:

  • Introduce Optimal Tree Refinement, a novel technique for reconstructing very large evolutionary trees.
  • Address the computational complexity of maximum parsimony and maximum compatibility problems.
  • Develop polynomial time algorithms for these challenging tree reconstruction tasks.

Main Methods:

  • Optimal Tree Refinement technique applied to tree reconstruction.
  • Analysis of polynomial time methods that may return tree contractions.

Related Experiment Videos

  • Investigation of hardness results and algorithmic development for NP-hard problems.

    • Main Results:

    • Demonstrated the effectiveness of Optimal Tree Refinement for large tree reconstruction.
    • Presented new polynomial time algorithms for maximum parsimony and maximum compatibility.
    • Provided hardness results related to these tree reconstruction problems.

    Conclusions:

    • Optimal Tree Refinement offers a significant advancement in reconstructing large evolutionary trees.
    • The developed algorithms provide efficient solutions for previously intractable problems.
    • This work bridges theoretical computer science with practical applications in biology and linguistics.