scientific article; zbMATH DE number 1945175

MaRDI QIDQ4410149zbMATH OpenFDO

Authors Bernard M. E. Moret, Usman W. Roshan, Tandy J. Warnow

Publication date 2 July 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2452/24520343.htm

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Nonnumerical algorithms (68W05) Protein sequences, DNA sequences (92D20)

Recommendations

• A few logs suffice to build (almost) all trees (I)
• The Performance of Phylogenetic Methods on Trees of Bounded Diameter
• Performance study of phylogenetic methods: (unweighted) quartet methods and neighbor-joining
• On the inference of large phylogenies with long branches: how long is too long?
• Performance study of phylogenetic methods: (unweighted) quartet methods and neighbor-joining

Cited in

(6)

• A basic limitation on inferring phylogenies by pairwise sequence comparisons
• Sequence length bounds for resolving a deep phylogenetic divergence
• Improving divergence time estimation in phylogenetics: more taxa vs. longer sequences
• A few logs suffice to build (almost) all trees (I)
• Large-Scale Multiple Sequence Alignment and Phylogeny Estimation
• On the inference of large phylogenies with long branches: how long is too long?

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4410149)