Cargando…
Tree edit distance for leaf-labelled trees on free leafset and its comparison with frequent subsplit dissimilarity and popular distance measures
BACKGROUND: This paper is devoted to distance measures for leaf-labelled trees on free leafset. A leaf-labelled tree is a data structure which is a special type of a tree where only leaves (terminal) nodes are labelled. This data structure is used in bioinformatics for modelling of evolution history...
Autores principales: | Koperwas, Jakub, Walczak, Krzysztof |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2011
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3117735/ https://www.ncbi.nlm.nih.gov/pubmed/21612645 http://dx.doi.org/10.1186/1471-2105-12-204 |
Ejemplares similares
-
Comparison of phylogenetic trees through alignment of embedded evolutionary distances
por: Choi, Kwangbom, et al.
Publicado: (2009) -
A generalized Robinson-Foulds distance for labeled trees
por: Briand, Samuel, et al.
Publicado: (2020) -
A multi-labeled tree dissimilarity measure for comparing “clonal trees” of tumor progression
por: Karpov, Nikolai, et al.
Publicado: (2019) -
Probabilistic Distances Between Trees
por: Garba, Maryam K, et al.
Publicado: (2018) -
Machine learning based imputation techniques for estimating phylogenetic trees from incomplete distance matrices
por: Bhattacharjee, Ananya, et al.
Publicado: (2020)