We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Tree edit distance for leaf-labelled trees on free leafset and its comparison with frequent subsplit dissimilarity and popular distance measures.
- Authors
Koperwas, Jakub; Walczak, Krzysztof
- Abstract
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 of genes and species and also in linguistics for modelling of languages evolution history. Many domain specific problems occur and need to be solved with help of tree postprocessing techniques such as distance measures.
- Publication
BMC bioinformatics, 2011, Vol 12, p204
- ISSN
1471-2105
- Publication type
Journal Article
- DOI
10.1186/1471-2105-12-204