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

Constructing additive trees when the error is small

L Wang1, D Gusfield

  • 1Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong.

Journal of Computational Biology : a Journal of Computational Molecular Cell Biology
|May 16, 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

Inference of haplotypes from samples of diploid populations: complexity and algorithms.

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

A practical algorithm for optimal inference of haplotypes from diploid populations.

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

Parametric and inverse-parametric sequence alignment with XPARAL.

Methods in enzymology·1996
Same author

Prodomain mutations at the subtilisin interface: correlation of binding energy and the rate of catalyzed folding.

Biochemistry·1995
Same author

Synthesis and characterization of a highly potent and effective antagonist of retinoic acid receptors.

Journal of medicinal chemistry·1995
Same author

Thermodynamic parameters for the helix-coil transition of oligopeptides: molecular dynamics simulation with the peptide growth method.

Proceedings of the National Academy of Sciences of the United States of America·1995

This study addresses constructing additive trees from distance data with errors. It identifies conditions for unique tree topologies and presents an efficient algorithm for small error scenarios.

Area of Science:

  • Computational Biology
  • Phylogenetics
  • Graph Theory

Background:

  • Additive trees represent evolutionary distances.
  • Constructing trees from pairwise distances is crucial in various fields.
  • Real-world data often contains observation errors.

Purpose of the Study:

  • To investigate the uniqueness of additive tree topology under noisy distance data.
  • To develop an efficient algorithm for additive tree construction with errors.

Main Methods:

  • Analysis of tree topology conditions.
  • Algorithm design for tree construction.
  • Error analysis in distance matrices.

Main Results:

  • Conditions for unique and semi-unique additive tree topologies were established.

Related Experiment Videos

  • An efficient algorithm was developed for constructing additive trees with small errors.

    • Conclusions:

    • Additive tree construction is feasible even with observation errors.
    • The developed algorithm provides an efficient solution for specific error levels.