Cargando…
The combinatorics of discrete time-trees: theory and open problems
A time-tree is a rooted phylogenetic tree such that all internal nodes are equipped with absolute divergence dates and all leaf nodes are equipped with sampling dates. Such time-trees have become a central object of study in phylogenetics but little is known about the parameter space of such objects...
Autores principales: | Gavryushkin, Alex, Whidden, Chris, Matsen, Frederick A. |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Springer Berlin Heidelberg
2017
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5829145/ https://www.ncbi.nlm.nih.gov/pubmed/28756523 http://dx.doi.org/10.1007/s00285-017-1167-9 |
Ejemplares similares
-
Quantifying MCMC Exploration of Phylogenetic Tree Space
por: Whidden, Chris, et al.
Publicado: (2015) -
Problems from the discrete to the continuous: probability, number theory, graph theory, and combinatorics
por: Pinsky, Ross G
Publicado: (2014) -
Discrete coalescent trees
por: Collienne, Lena, et al.
Publicado: (2021) -
Computational discrete mathematics: combinatorics and graph theory with mathematica
por: Pemmaraju, Sriram, et al.
Publicado: (2003) -
Mathematical problems and proofs: combinatorics, number theory, and geometry
por: Kisacanin, Branislav
Publicado: (1998)