Cargando…
CBTH: A New Algorithm for Maximum Rooted Triplets Consistency Problem
BACKGROUND: Phylogenetics is a branch of bioinformatics that studies and models the evolutionary relationships between currently living species. A phylogenetic tree is the simplest possible model in which leaves are distinctly labeled by species. Rooted triplets are one of the most important inputs...
Autores principales: | Poor mohammadi, Hadi, Sardari Zarchi, Mohsen |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
National Institute of Genetic Engineering and Biotechnology
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8035419/ https://www.ncbi.nlm.nih.gov/pubmed/33850946 http://dx.doi.org/10.30498/IJB.2020.196341.2557 |
Ejemplares similares
-
Netcombin: An algorithm for constructing optimal phylogenetic network from rooted triplets
por: Poormohammadi, Hadi, et al.
Publicado: (2020) -
TripNet: A Method for Constructing Rooted Phylogenetic Networks from Rooted Triplets
por: Poormohammadi, Hadi, et al.
Publicado: (2014) -
The maximum clique enumeration problem: algorithms, applications, and implementations
por: Eblen, John D, et al.
Publicado: (2012) -
ICPTC: Iranian commercial pistachio tree cultivars standard dataset
por: Heidary-Sharifabad, Ahmad, et al.
Publicado: (2021) -
Back to the doublet-triplet splitting problem
por: Barbieri, Riccardo, et al.
Publicado: (1993)