New Fixed-Parameter Algorithms for the Minimum Quartet Inconsistency Problem
From MaRDI portal
Publication:3503579
DOI10.1007/978-3-540-79723-4_8zbMath1142.68597MaRDI QIDQ3503579
Maw-Shang Chang, Peter Rossmanith, Chuang-Chieh Lin
Publication date: 5 June 2008
Published in: Parameterized and Exact Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-79723-4_8
68Q25: Analysis of algorithms and problem complexity
92D15: Problems related to evolution
68W05: Nonnumerical algorithms
68R10: Graph theory (including graph drawing) in computer science
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reconstructing the shape of a tree from observed dissimilarity data
- A polynomial time algorithm for the minimum quartet inconsistency problem with \(O(n)\) quartet errors
- The complexity of reconstructing trees from qualitative characters and subtrees
- A general method to speed up fixed-parameter-tractable algorithms
- A fixed-parameter algorithm for minimum quartet inconsistency
- A Polynomial Time Approximation Scheme for Inferring Evolutionary Trees from Quartet Topologies and Its Application