Computing the quartet distance between evolutionary trees in time \(O(n\,\log n)\)
From MaRDI portal
Publication:1889603
DOI10.1007/s00453-003-1065-yzbMath1072.68121OpenAlexW2160517437MaRDI QIDQ1889603
Rolf Fagerberg, Gerth Stølting Brodal, Christian N. S. Pedersen
Publication date: 2 December 2004
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-003-1065-y
Analysis of algorithms and problem complexity (68Q25) Problems related to evolution (92D15) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10)
Related Items (9)
A Variance-Components Model for Distance-Matrix Phylogenetic Reconstruction ⋮ Fast error-tolerant quartet phylogeny algorithms ⋮ A high quartet distance construction ⋮ Comparing and aggregating partially resolved trees ⋮ Fast Error-Tolerant Quartet Phylogeny Algorithms ⋮ Polyhedral geometry of phylogenetic rogue taxa ⋮ Comparing and Aggregating Partially Resolved Trees ⋮ Rapidly computing the phylogenetic transfer index ⋮ An \(O(n \log n)\) time algorithm for computing the path-length distance between trees
This page was built for publication: Computing the quartet distance between evolutionary trees in time \(O(n\,\log n)\)
