Finding a Perfect Phylogeny from Mixed Tumor Samples

DOI10.1007/978-3-662-48221-6_6zbMath1367.92083OpenAlexW1730095690MaRDI QIDQ5283823

Ademir Hujdurović, Alexandru I. Tomescu, Bernard Ries, Urša Kačar, Martin Milanič

Publication date: 25 July 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://repozitorij.upr.si/Dokument.php?id=8560&dn=

zbMATH Keywords

NP-hardnessperfect phylogenytumor evolution

Mathematics Subject Classification ID

Problems related to evolution (92D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computational methods for problems pertaining to biology (92-08)

Related Items (1)

Parameterized Complexity for Finding a Perfect Phylogeny from Mixed Tumor Samples

Cites Work

• An idealized concept of the true cladistic character
• Algorithmic graph theory and perfect graphs
• The NP-Completeness of Edge-Coloring
• Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
• Algorithms on Strings, Trees and Sequences
• Reconstructing Mutational History in Multiply Sampled Tumors Using Perfect Phylogeny Mixtures
• Efficient algorithms for inferring evolutionary trees

This page was built for publication: Finding a Perfect Phylogeny from Mixed Tumor Samples