Cargando…
Reconstructing Tree-Child Networks from Reticulate-Edge-Deleted Subnetworks
Network reconstruction lies at the heart of phylogenetic research. Two well-studied classes of phylogenetic networks include tree-child networks and level-k networks. In a tree-child network, every non-leaf node has a child that is a tree node or a leaf. In a level-k network, the maximum number of r...
Autores principales: | Murakami, Yukihiro, van Iersel, Leo, Janssen, Remie, Jones, Mark, Moulton, Vincent |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Springer US
2019
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6764941/ https://www.ncbi.nlm.nih.gov/pubmed/31297691 http://dx.doi.org/10.1007/s11538-019-00641-w |
Ejemplares similares
-
Orchard Networks are Trees with Additional Horizontal Arcs
por: van Iersel, Leo, et al.
Publicado: (2022) -
Linear Time Algorithm for Tree-Child Network Containment
por: Janssen, Remie, et al.
Publicado: (2020) -
How Much Information is Needed to Infer Reticulate Evolutionary Histories?
por: Huber, Katharina T., et al.
Publicado: (2015) -
Distinguishing level-1 phylogenetic networks on the basis of data generated by Markov processes
por: Gross, Elizabeth, et al.
Publicado: (2021) -
Reconstructing k-Reticulated Phylogenetic Network from a Set of Gene Trees
por: Vu, Hoa, et al.
Publicado: (2013)