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

DTL reconciliation repair.

Weiyun Ma1, Dmitriy Smirnov2, Ran Libeskind-Hadas3

  • 1Department of Computer Science, Harvey Mudd College, Claremont, California, USA.

BMC Bioinformatics
|April 1, 2017
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

Pairwise Distances and the Problem of Multiple Optima.

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

xenoGI 3: using the DTLOR model to reconstruct the evolution of gene families in clades of microbes.

BMC bioinformatics·2023
Same author

Tree Reconciliation Methods for Host-Symbiont Cophylogenetic Analyses.

Life (Basel, Switzerland)·2022
Same author

A Polynomial-Time Algorithm for Minimizing the Deep Coalescence Cost for Level-1 Species Networks.

IEEE/ACM transactions on computational biology and bioinformatics·2021
Same author

Maximum parsimony reconciliation in the DTLOR model.

BMC bioinformatics·2021
Same author

eMPRess: a systematic cophylogeny reconciliation tool.

Bioinformatics (Oxford, England)·2020

This study introduces a novel method for maximum parsimony phylogenetic tree reconciliation. The new approach efficiently repairs infeasible reconciliations, often yielding superior results compared to existing heuristics.

Area of Science:

  • Computational Biology
  • Phylogenetics
  • Evolutionary Biology

Background:

  • Maximum parsimony phylogenetic tree reconciliation is crucial for understanding evolutionary relationships.
  • The problem of finding temporally feasible reconciliations is computationally challenging (NP-complete).
  • Existing methods rely on exact algorithms with high computational cost or heuristics that may not find optimal solutions.

Purpose of the Study:

  • To develop an efficient and effective method for maximum parsimony phylogenetic tree reconciliation.
  • To address the limitations of current exact and heuristic approaches.

Main Methods:

  • An iterative repair strategy for potentially infeasible maximum parsimony reconciliations.
  • The approach refines reconciliations until temporal feasibility is achieved.
Keywords:
DTL reconciliationPhylogenetic reconciliationUndated trees

Related Experiment Videos

Main Results:

  • The proposed method efficiently generates temporally feasible maximum parsimony reconciliations.
  • In several cases, the new approach produced better solutions than the established Jane heuristic.

Conclusions:

  • The iterative repair method offers a promising alternative for phylogenetic tree reconciliation.
  • This technique can improve the accuracy and efficiency of reconstructing evolutionary histories.