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...

Descripción completa

Detalles Bibliográficos
Autores principales: Koperwas, Jakub, Walczak, Krzysztof
Formato: Online Artículo Texto
Lenguaje:English
Publicado: BioMed Central 2011
Materias:
Methodology Article
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

Internet

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