Fast Error-Tolerant Quartet Phylogeny Algorithms

DOI10.1007/978-3-642-21458-5_14zbMath1339.92057arXiv1010.1866OpenAlexW2567739102MaRDI QIDQ3011850

Jakub Truszkowski, Daniel G. Brown

Publication date: 29 June 2011

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1010.1866

zbMATH Keywords

taxaphylogeny algorithms

Mathematics Subject Classification ID

Problems related to evolution (92D15) Computational methods for problems pertaining to biology (92-08)

Related Items (3)

Fast error-tolerant quartet phylogeny algorithms ⋮ Unnamed Item ⋮ Unnamed Item

Uses Software

• Pfam
• FastTree
• Scoredist

Cites Work

• Computing the quartet distance between evolutionary trees in time \(O(n\,\log n)\)
• A few logs suffice to build (almost) all trees. II
• Computing with Noisy Information
• Determining the Evolutionary Tree Using Experiments
• Concentration of Measure for the Analysis of Randomized Algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Fast Error-Tolerant Quartet Phylogeny Algorithms