Character-based phylogeny construction and its application to tumor evolution
From MaRDI portal
Publication:2011627
DOI10.1007/978-3-319-58741-7_1zbMath1430.92052OpenAlexW2612150380MaRDI QIDQ2011627
Raffaella Rizzi, Murray Patterson, Mauricio Soto, Gianluca Della Vedova
Publication date: 4 August 2017
Full work available at URL: https://doi.org/10.1007/978-3-319-58741-7_1
Uses Software
Cites Work
- The binary perfect phylogeny with persistent characters
- A colored graph approach to perfect phylogeny with persistent characters
- Haplotyping with missing data via perfect path phylogenies
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- A linear-time algorithm for the perfect phylogeny haplotype problem
- Phylogeny
- Algorithms on Strings, Trees and Sequences
- A Polynomial-Time Algorithm For the Perfect Phylogeny Problem When the Number of Character States is Fixed
- A Fast Algorithm for the Computation and Enumeration of Perfect Phylogenies
- Incomplete Directed Perfect Phylogeny
- On the Generalised Character Compatibility Problem for Non-branching Character Trees
- Research in Computational Molecular Biology
- Research in Computational Molecular Biology
- Efficient algorithms for inferring evolutionary trees
- Minimizing phylogenetic number to find good evolutionary trees
This page was built for publication: Character-based phylogeny construction and its application to tumor evolution