Cargando…
Clustering systems of phylogenetic networks
Rooted acyclic graphs appear naturally when the phylogenetic relationship of a set X of taxa involves not only speciations but also recombination, horizontal transfer, or hybridization that cannot be captured by trees. A variety of classes of such networks have been discussed in the literature, incl...
Autores principales: | Hellmuth, Marc, Schaller, David, Stadler, Peter F. |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Springer Berlin Heidelberg
2023
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10564800/ https://www.ncbi.nlm.nih.gov/pubmed/37573261 http://dx.doi.org/10.1007/s12064-023-00398-w |
Ejemplares similares
-
A simpler linear-time algorithm for the common refinement of rooted phylogenetic trees on a common leaf set
por: Schaller, David, et al.
Publicado: (2021) -
From pairs of most similar sequences to phylogenetic best matches
por: Stadler, Peter F., et al.
Publicado: (2020) -
Complete Characterization of Incorrect Orthology Assignments in Best Match Graphs
por: Schaller, David, et al.
Publicado: (2021) -
Heuristic algorithms for best match graph editing
por: Schaller, David, et al.
Publicado: (2021) -
Indirect identification of horizontal gene transfer
por: Schaller, David, et al.
Publicado: (2021)