Cargando…
The rigid hybrid number for two phylogenetic trees
Recently there has been considerable interest in the problem of finding a phylogenetic network with a minimum number of reticulation vertices which displays a given set of phylogenetic trees, that is, a network with minimum hybrid number. Such networks are useful for representing the evolution of sp...
Autores principales: | Huber, Katharina T., Linz, Simone, Moulton, Vincent |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Springer Berlin Heidelberg
2021
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7997861/ https://www.ncbi.nlm.nih.gov/pubmed/33770290 http://dx.doi.org/10.1007/s00285-021-01594-2 |
Ejemplares similares
-
Folding and unfolding phylogenetic trees and networks
por: Huber, Katharina T., et al.
Publicado: (2016) -
A Reduction Algorithm for Computing The Hybridization Number of Two Trees
por: Bordewich, Magnus, et al.
Publicado: (2007) -
Tree-Based Unrooted Phylogenetic Networks
por: Francis, A., et al.
Publicado: (2017) -
Minimum triplet covers of binary phylogenetic X-trees
por: Huber, K. T., et al.
Publicado: (2017) -
Bounds for phylogenetic network space metrics
por: Francis, Andrew, et al.
Publicado: (2017)