The binary perfect phylogeny with persistent characters
From MaRDI portal
Publication:714807
DOI10.1016/j.tcs.2012.05.035zbMath1250.92035arXiv1110.6739OpenAlexW2072719910MaRDI QIDQ714807
Chiara Braghin, Paola Bonizzoni, Riccardo Dondi, Gabriella Trucco
Publication date: 11 October 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1110.6739
Problems related to evolution (92D15) Applications of graph theory (05C90) Computational methods for problems pertaining to biology (92-08)
Related Items
Combinatorial perspectives on Dollo-\(k\) characters in phylogenetics, Incomplete directed perfect phylogeny in linear time, Combinatorial views on persistent characters in phylogenetics, Mathematical Models and Solutions for the Analysis of Human Genotypes, Character-based phylogeny construction and its application to tumor evolution, A colored graph approach to perfect phylogeny with persistent characters
Cites Work
- Unnamed Item
- A linear-time algorithm for the perfect phylogeny haplotype problem
- An Important Connection Between Network Motifs and Parsimony Models
- Incomplete Directed Perfect Phylogeny
- Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
- Efficient algorithms for inferring evolutionary trees