A fixed-parameter algorithm for minimum quartet inconsistency
From MaRDI portal
Publication:1877704
DOI10.1016/S0022-0000(03)00077-1zbMath1093.68139OpenAlexW2117466143MaRDI QIDQ1877704
Publication date: 19 August 2004
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0022-0000(03)00077-1
Analysis of algorithms and problem complexity (68Q25) Problems related to evolution (92D15) Nonnumerical algorithms (68W05)
Related Items (10)
A polynomial time algorithm for the minimum quartet inconsistency problem with \(O(n)\) quartet errors ⋮ Reconstructing phylogenetic trees from multipartite quartet systems ⋮ Cherry picking: a characterization of the temporal hybridization number for a set of phylogenies ⋮ 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 ⋮ A property tester for tree-likeness of quartet topologies ⋮ Testing consistency of quartet topologies: a parameterized approach ⋮ Unnamed Item ⋮ Minimum tree cost quartet puzzling
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reconstructing the shape of a tree from observed dissimilarity data
- An efficient fixed-parameter algorithm for 3-hitting set
- The complexity of reconstructing trees from qualitative characters and subtrees
- Inferring evolutionary trees with strong combinatorial evidence
- 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
- Parameterizing above Guaranteed Values: MaxSat and MaxCut
- Faster exact algorithms for hard problems: A parameterized point of view
This page was built for publication: A fixed-parameter algorithm for minimum quartet inconsistency
