140 search results - page 7 / 28 » Computing the Edit-Distance between Unrooted Ordered Trees |
SSDBM
2010
IEEE
14 years 28 days ago
2010
IEEE
Similarity search and similarity join on strings are important for applications such as duplicate detection, error detection, data cleansing, or comparison of biological sequences....
WALCOM
2010
IEEE
14 years 3 months ago
2010
IEEE
Abstract. Arc-annotated sequences are useful for representing structural information of RNAs and have been extensively used for comparing RNA structures in both terms of sequence a...
IWOCA
2010
Springer
13 years 3 months ago
2010
Springer
We consider here the problem of chaining seeds in ordered trees. Seeds are mappings between two trees Q and T and a chain is a subset of non overlapping seeds that is consistent wi...
JCB
2000
13 years 8 months ago
2000
It has been postulated that existing species have been linked in the past in a way that can be described using an additive tree structure. Any such tree structure reflecting speci...
LICS
2006
IEEE
14 years 2 months ago
2006
IEEE
We prove that the modal mu-calculus model-checking problem for (ranked and ordered) node-labelled trees that are generated by order-n recursion schemes (whether safe or not, and w...