34 search results - page 1 / 7 » The Computational Hardness of Estimating Edit Distance |
SIAMCOMP
2010
13 years 3 months ago
2010
ICPR
2004
IEEE
14 years 6 months ago
2004
IEEE
Graph edit distance provides an error-tolerant way to measure distances between attributed graphs. The effectiveness of edit distance based graph classification algorithms relies ...
ACL
2009
13 years 2 months ago
2009
Recently, there is a growing interest in working with tree-structured data in different applications and domains such as computational biology and natural language processing. Mor...
ISAAC
2003
Springer
13 years 10 months ago
2003
Springer
Given a string x and a language L, the Hamming distance of x to L is the minimum Hamming distance of x to any string in L. The edit distance of a string to a language is analogous...
JCB
2006
13 years 4 months ago
2006
Tree structures are useful for describing and analyzing biological objects and processes. Consequently, there is a need to design metrics and algorithms to compare trees. A natura...