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

DOI10.1016/J.IPL.2006.05.013zbMATH Open1185.68837OpenAlexW2142543306MaRDI QIDQ845860FDOQ845860

Authors: Gang Wu, Jia-Huai You, Guohui 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

Recommendations

• A fixed-parameter algorithm for minimum quartet inconsistency
• New Fixed-Parameter Algorithms for the Minimum Quartet Inconsistency Problem
• New fixed-parameter algorithms for the minimum quartet inconsistency problem
• scientific article; zbMATH DE number 1786463
• Fast error-tolerant quartet phylogeny algorithms

zbMATH Keywords

algorithmsphylogeny constructionquartet

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Cites Work

• Reconstructing the shape of a tree from observed dissimilarity data
• Tree structures for proximity 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 big trees from short sequences
• Title not available (Why is that?)
• Constructing optimal trees from quartets
• A few logs suffice to build (almost) all trees (I)
• A polynomial time approximation scheme for inferring evolutionary trees from quartet topologies and its application
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Maximum Likelihood for Genome Phylogeny on Gene Content

Cited In (7)

• Kernel and fast algorithm for dense triplet inconsistency
• Minimum tree cost quartet puzzling
• New fixed-parameter algorithms for the minimum quartet inconsistency problem
• New Fixed-Parameter Algorithms for the Minimum Quartet Inconsistency Problem
• A fixed-parameter algorithm for minimum quartet inconsistency
• Title not available (Why is that?)
• Testing consistency of quartet topologies: a parameterized approach

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q845860)