Unique perfect phylogeny is intractable

DOI10.1016/j.tcs.2012.12.048zbMath1266.68118OpenAlexW2028660520MaRDI QIDQ1945932

Juraj Stacho, Michel A. Habib

Publication date: 17 April 2013

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.12.048

zbMATH Keywords

triangulationchordal graphintractabilityunique solutionperfect phylogenychordal sandwich

Mathematics Subject Classification ID

Applications of graph theory (05C90) Biochemistry, molecular biology (92C40) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Unique Perfect Phylogeny Is NP-Hard

This page was built for publication: Unique perfect phylogeny is intractable