Parameterized Complexity for Finding a Perfect Phylogeny from Mixed Tumor Samples

DOI10.1137/21m1449269zbMath1522.92042OpenAlexW4386749297MaRDI QIDQ6077980

Unnamed Author, Biing-Feng Wang

Publication date: 27 September 2023

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/21m1449269

zbMATH Keywords

algorithmsfixed-parameter tractabilityperfect phylogeniesdistinct split-row problemsplit-row problem

Mathematics Subject Classification ID

Problems related to evolution (92D15) Applications of graph theory (05C90) Parameterized complexity, tractability and kernelization (68Q27)

Cites Work

• Unnamed Item
• Unnamed Item
• Fourier meets M\"{o}bius: fast subset convolution
• Algorithms on Strings, Trees and Sequences
• A Fast Algorithm for the Computation and Enumeration of Perfect Phylogenies
• A Polynomial-Time Algorithm for Near-Perfect Phylogeny
• Perfect Phylogenies via Branchings in Acyclic Digraphs and a Generalization of Dilworth’s Theorem
• Incomplete Directed Perfect Phylogeny
• Reconstructing Mutational History in Multiply Sampled Tumors Using Perfect Phylogeny Mixtures
• Finding a Perfect Phylogeny from Mixed Tumor Samples
• Parameterized Algorithms
• The Transitive Reduction of a Directed Graph
• Efficient algorithms for inferring evolutionary trees

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