On the Generalised Character Compatibility Problem for Non-branching Character Trees
From MaRDI portal
Publication:5323073
DOI10.1007/978-3-642-02882-3_27zbMath1248.68254OpenAlexW1523916760MaRDI QIDQ5323073
Murray Patterson, Arvind Kumar Gupta, Ján Maňuch
Publication date: 23 July 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10281/217385
Analysis of algorithms and problem complexity (68Q25) Problems related to evolution (92D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (2)
Character-based phylogeny construction and its application to tumor evolution ⋮ A colored graph approach to perfect phylogeny with persistent characters
Cites Work
- Unnamed Item
- The complexity of reconstructing trees from qualitative characters and subtrees
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- Building PQR trees in almost-linear time
- Total Ordering Problem
- Triangulating Vertex-Colored Graphs
- Inferring Evolutionary History From DNA Sequences
- A Polynomial-Time Algorithm For the Perfect Phylogeny Problem When the Number of Character States is Fixed
This page was built for publication: On the Generalised Character Compatibility Problem for Non-branching Character Trees
