New Fixed-Parameter Algorithms for the Minimum Quartet Inconsistency Problem
From MaRDI portal
Recommendations
- New fixed-parameter algorithms for the minimum quartet inconsistency problem
- A fixed-parameter algorithm for minimum quartet inconsistency
- scientific article; zbMATH DE number 1786463
- A polynomial time algorithm for the minimum quartet inconsistency problem with O(n) quartet errors
- scientific article; zbMATH DE number 6297767
Cites work
- A few logs suffice to build (almost) all trees (I)
- A fixed-parameter algorithm for minimum quartet inconsistency
- A general method to speed up fixed-parameter-tractable algorithms
- A polynomial time algorithm for the minimum quartet inconsistency problem with O(n) quartet errors
- A polynomial time approximation scheme for inferring evolutionary trees from quartet topologies and its application
- scientific article; zbMATH DE number 1302377 (Why is no real title available?)
- scientific article; zbMATH DE number 1507224 (Why is no real title available?)
- scientific article; zbMATH DE number 1405796 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- Reconstructing the shape of a tree from observed dissimilarity data
- The complexity of reconstructing trees from qualitative characters and subtrees
Cited in
(6)- A fixed-parameter algorithm for minimum quartet inconsistency
- New fixed-parameter algorithms for the minimum quartet inconsistency problem
- An exact algorithm for the minimum quartet tree cost problem
- Testing consistency of quartet topologies: a parameterized approach
- scientific article; zbMATH DE number 1786463 (Why is no real title available?)
- A polynomial time algorithm for the minimum quartet inconsistency problem with O(n) quartet errors
This page was built for publication: New Fixed-Parameter Algorithms for the Minimum Quartet Inconsistency Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3503579)