The binary perfect phylogeny with persistent characters
Authors:
- Paola BonizzoniPBPaola Bonizzoni
- Chiara BraghinCBChiara Braghin
- Riccardo DondiRDRiccardo Dondi
- Gabriella TruccoGTGabriella Trucco
- 1 October 2012
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 454, 51-63
Abstract
No abstract availableKeywords
All Related Versions
This publication has 15 references indexed in Scilit:
- Support for the Coelomata Clade of Animals from a Rigorous Analysis of the Pattern of Intron ConservationMolecular Biology and Evolution, 2007
- A Linear-Time Algorithm for the Perfect Phylogeny Haplotype ProblemAlgorithmica, 2007
- Constructing Near-Perfect Phylogenies with multiple homoplasy eventsBioinformatics, 2006
- An Optimal Algorithm for Perfect Phylogeny HaplotypingJournal of Computational Biology, 2006
- A Linear-Time Algorithm for the Perfect Phylogeny Haplotyping (PPH) ProblemJournal of Computational Biology, 2006
- Graph Theoretical Insights into Evolution of Multidomain ProteinsJournal of Computational Biology, 2006
- Incomplete Directed Perfect PhylogenySIAM Journal on Computing, 2004
- Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivityJournal of the ACM, 2001
- Efficient algorithms for inferring evolutionary treesNetworks, 1991
- A Method for Deducing Branching Sequences in PhylogenyEvolution, 1965