Fast error-tolerant quartet phylogeny algorithms

DOI10.1016/j.tcs.2012.02.016zbMath1292.68154OpenAlexW2964231993MaRDI QIDQ390892

Daniel G. Brown, Jakub Truszkowski

Publication date: 9 January 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.02.016

zbMATH Keywords

quartet-based phylogeny algorithm

Mathematics Subject Classification ID

Searching and sorting (68P10) Problems related to evolution (92D15) Randomized algorithms (68W20)

Related Items (1)

Rapidly computing the phylogenetic transfer index

Uses Software

• FastTree

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing the quartet distance between evolutionary trees in time \(O(n\,\log n)\)
• A few logs suffice to build (almost) all trees. II
• Fast Error-Tolerant Quartet Phylogeny Algorithms
• Phylogenies without Branch Bounds: Contracting the Short, Pruning the Deep
• A note on the height of binary search trees
• Computing with Noisy Information
• Determining the Evolutionary Tree Using Experiments
• Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE
• Concentration of Measure for the Analysis of Randomized Algorithms

This page was built for publication: Fast error-tolerant quartet phylogeny algorithms