The three-state perfect phylogeny problem reduces to 2-SAT
From MaRDI portal
Publication:966200
DOI10.4310/CIS.2009.v9.n4.a1zbMath1194.92058OpenAlexW2003561020MaRDI QIDQ966200
Publication date: 23 April 2010
Published in: Communications in Information and Systems (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.cis/1267712110
Problems related to evolution (92D15) Partitions of sets (05A18) Complexity and performance of numerical algorithms (65Y20)
Related Items (2)
On reachable assignments in cycles ⋮ A simple characterization of the minimal obstruction sets for three-state perfect phylogenies
This page was built for publication: The three-state perfect phylogeny problem reduces to 2-SAT
