Cargando…
A Reduction Algorithm for Computing The Hybridization Number of Two Trees
Hybridization is an important evolutionary process for many groups of species. Thus, conflicting signals in a data set may not be the result of sampling or modeling errors, but due to the fact that hybridization has played a significant role in the evolutionary history of the species under considera...
Autores principales: | Bordewich, Magnus, Linz, Simone, St. John, Katherine, Semple, Charles |
---|---|
Formato: | Texto |
Lenguaje: | English |
Publicado: |
Libertas Academica
2007
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2684132/ https://www.ncbi.nlm.nih.gov/pubmed/19461978 |
Ejemplares similares
-
The rigid hybrid number for two phylogenetic trees
por: Huber, Katharina T., et al.
Publicado: (2021) -
A practical approximation algorithm for solving massive instances of hybridization number for binary and nonbinary trees
por: Iersel, Leo van, et al.
Publicado: (2014) -
Mathematics and computer science: algorithms, trees, combinatorics and probabilities
por: Gardy, Danièle, et al.
Publicado: (2000) -
An optimal algorithm for computing all subtree repeats in trees
por: Flouri, T., et al.
Publicado: (2014) -
A sub-cubic time algorithm for computing the quartet distance between two general trees
por: Nielsen, Jesper, et al.
Publicado: (2011)