Maximal Accurate Forests from Distance Matrices

DOI10.1007/11732990_24MaRDI QIDQ3596266zbMATH OpenOpenAlexFDO

Authors

Publication date 30 August 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11732990_24

Mathematics Subject Classification ID

Applications of statistics to biology and medical sciences; meta analysis (62P10) Applications of graph theory (05C90) Problems related to evolution (92D15) Trees (05C05)

Recommendations

• Phylogenies without branch bounds: contracting the short, pruning the deep
• A fast algorithm for constructing trees from distance matrices
• scientific article; zbMATH DE number 1088265
• Fast error-tolerant quartet phylogeny algorithms
• Fast error-tolerant quartet phylogeny algorithms

Cited in

(8)

• Phylogenies without branch bounds: contracting the short, pruning the deep
• Large-Scale Multiple Sequence Alignment and Phylogeny Estimation
• Fast phylogeny reconstruction through learning of ancestral sequences
• The minimum evolution distance-based approach to phylogenetic inference
• Maximal sub-triangulation in pre-processing phylogenetic data
• Alignment-free phylogenetic reconstruction: Sample complexity via a branching process analysis
• Fast and reliable reconstruction of phylogenetic trees with indistinguishable edges
• Forest Alignment with Affine Gaps and Anchors

This page was built for publication: Maximal Accurate Forests from Distance Matrices

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