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

Fast algorithms for inferring evolutionary trees

R Agarwala1, D Fernández-Baca, G Slutzki

  • 1DIMACS (Center for Discrete Mathematics and Theoretical Computer Science), Rutgers University, Piscataway, NJ 08855, USA.

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

Haemostatic disorders in pregnancy.

BJA education·2021
Same author

A pitfall of Autopulse.

Anaesthesia·2011
Same author

A 4,103 marker integrated physical and comparative map of the horse genome.

Cytogenetic and genome research·2008
Same author

First radiation hybrid map of the river buffalo X chromosome (BBUX) and comparison with BTAX.

Animal genetics·2008
Same author

A radiation hybrid map of river buffalo (Bubalus bubalis) chromosome 7 and comparative mapping to the cattle and human genomes.

Cytogenetic and genome research·2008
Same author

A radiation hybrid map of river buffalo (Bubalus bubalis) chromosome 1 (BBU1).

Cytogenetic and genome research·2007

We developed new algorithms for the perfect phylogeny problem with binary characters. These algorithms improve efficiency, especially for sparse data, and offer online processing capabilities for evolving datasets.

Area of Science:

  • Computational Biology
  • Phylogenetics
  • Algorithm Design

Background:

  • The perfect phylogeny problem is central to understanding evolutionary relationships.
  • Existing algorithms can be inefficient with sparse data or dynamic datasets.

Purpose of the Study:

  • To present novel algorithms for the perfect phylogeny problem with binary characters.
  • To improve computational efficiency for sparse matrices and enable online processing.

Main Methods:

  • Development of a faster algorithm for sparse input matrices.
  • Design of two online algorithms: one for sequential character input, another for sequential species input.
  • Integration of online algorithms for dynamic additions/deletions of species and characters.

Related Experiment Videos

Main Results:

  • The first algorithm outperforms Gusfield's algorithm on sparse data.
  • The online algorithms efficiently handle streaming data for species and characters.
  • A combined algorithm effectively manages dynamic changes in both species and characters.

Conclusions:

  • The presented algorithms offer significant improvements in efficiency and flexibility for perfect phylogeny reconstruction.
  • These methods are particularly valuable for large and evolving biological datasets.
  • The work advances the computational tools available for phylogenetic analysis.