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

Solving large scale phylogenetic problems using DCM2.

D H Huson1, L Vawter, T J Warnow

  • 1Princeton University, NJ, USA. huson@math.princeton.edu

Proceedings. International Conference on Intelligent Systems for Molecular Biology
|April 29, 2000
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

Estimating the association between antibiotic exposure and colonization with extended-spectrum β-lactamase-producing Gram-negative bacteria using machine learning methods: a multicentre, prospective cohort study.

Clinical microbiology and infection : the official publication of the European Society of Clinical Microbiology and Infectious Diseases·2019
Same author

Dynamics of the human gut phageome during antibiotic treatment.

Computational biology and chemistry·2018
Same author

CLUSEAN: a computer-based framework for the automated analysis of bacterial secondary metabolite biosynthetic gene clusters.

Journal of biotechnology·2009
Same author

Phylogenetic super-networks from partial trees.

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

Cloning, pharmacology, and tissue distribution of G-protein-coupled receptor GPR105 (KIAA0001) rodent orthologs.

Genomics·2001
Same author

Design of a compartmentalized shotgun assembler for the human genome.

Bioinformatics (Oxford, England)·2001
Same journal

Proceedings of the 8th International Conference on Intelligent Systems for Molecular Biology (ISMB 2000). San Diego, California, USA. August 19-23, 2000.

Proceedings. International Conference on Intelligent Systems for Molecular Biology·2001
Same journal

Analysis of gene expression data with pathway scores.

Proceedings. International Conference on Intelligent Systems for Molecular Biology·2000
Same journal

Towards a complete map of the protein space based on a unified sequence and structure analysis of all known proteins.

Proceedings. International Conference on Intelligent Systems for Molecular Biology·2000
Same journal

Mining for putative regulatory elements in the yeast genome using gene expression data.

Proceedings. International Conference on Intelligent Systems for Molecular Biology·2000
Same journal

A multiple alignment algorithm for metabolic pathway analysis using enzyme hierarchy.

Proceedings. International Conference on Intelligent Systems for Molecular Biology·2000
Same journal

Sequence database search using jumping alignments.

Proceedings. International Conference on Intelligent Systems for Molecular Biology·2000
See all related articles

The Disk Covering Method (DCM) enhances phylogenetic tree reconstruction accuracy. A new variant, DCM2, accelerates solutions for complex NP-hard problems, improving phylogenetic analysis for large datasets.

Area of Science:

  • Computational Biology
  • Phylogenetics
  • Bioinformatics

Background:

  • Phylogenetic tree reconstruction is crucial for understanding evolutionary relationships.
  • Existing methods, particularly polynomial time distance-based approaches, can lack accuracy on large datasets.
  • NP-hard optimization problems present significant challenges in phylogenetic analysis.

Purpose of the Study:

  • To introduce DCM2, a variant of the Disk Covering Method (DCM).
  • To demonstrate DCM2's utility in accelerating searches for Maximum Parsimony trees.
  • To highlight the necessity of efficient solutions for NP-hard problems in phylogenetics.

Main Methods:

  • The study discusses a novel variant of the Disk Covering Method (DCM2).
  • DCM2 is specifically designed for phylogenetic methods addressing NP-hard optimization problems.

Related Experiment Videos

  • The paper analyzes DCM2's application in speeding up Maximum Parsimony tree searches.

    • Main Results:

    • DCM2 is shown to accelerate the search for Maximum Parsimony trees.
    • The study provides evidence that popular polynomial time distance methods exhibit poor accuracy on certain large, important datasets.
    • This underscores the need for advanced methods like DCM2.

    Conclusions:

    • DCM2 offers an effective approach for tackling NP-hard optimization problems in phylogenetics.
    • The development of DCM2 addresses limitations of existing methods, particularly for complex and large-scale phylogenetic analyses.
    • This work contributes to improving the accuracy and efficiency of evolutionary tree reconstruction.