A polynomial time algorithm for the minimum quartet inconsistency problem with \(O(n)\) quartet errors

DOI10.1016/j.ipl.2006.05.013zbMath1185.68837OpenAlexW2142543306MaRDI QIDQ845860

Gang Wu, Jia-Huai You, Guo-Hui Lin

Publication date: 29 January 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2006.05.013

zbMATH Keywords

algorithmsphylogeny constructionquartet

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Related Items (5)

Kernel and fast algorithm for dense triplet inconsistency ⋮ New Fixed-Parameter Algorithms for the Minimum Quartet Inconsistency Problem ⋮ New fixed-parameter algorithms for the minimum quartet inconsistency problem ⋮ Testing consistency of quartet topologies: a parameterized approach ⋮ Minimum tree cost quartet puzzling

Cites Work

• Reconstructing the shape of a tree from observed dissimilarity data
• The complexity of reconstructing trees from qualitative characters and subtrees
• Inferring evolutionary trees with strong combinatorial evidence
• A fixed-parameter algorithm for minimum quartet inconsistency
• Constructing Optimal Trees from Quartets
• A Polynomial Time Approximation Scheme for Inferring Evolutionary Trees from Quartet Topologies and Its Application
• Tree structures for proximity data
• A few logs suffice to build (almost) all trees (I)
• Constructing big trees from short sequences
• Maximum Likelihood for Genome Phylogeny on Gene Content
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A polynomial time algorithm for the minimum quartet inconsistency problem with \(O(n)\) quartet errors