179 search results - page 4 / 36 » An Optimal Decomposition Algorithm for Tree Edit Distance |
WWW
2004
ACM
15 years 10 months ago
2004
ACM
The Web poses itself as the largest data repository ever available in the history of humankind. Major efforts have been made in order to provide efficient access to relevant infor...
82
Voted
STRINGOLOGY
2004
14 years 11 months ago
2004
Abstract. The edit distance between strings A and B is defined as the minimum number of edit operations needed in converting A into B or vice versa. Typically the allowed edit oper...
SODA
2010
ACM
14 years 7 months ago
2010
ACM
We give near-tight bounds for estimating the edit distance between two non-repetitive strings (Ulam distance) with constant approximation, in sub-linear time. For two strings of l...
78
Voted
JEA
2008
14 years 9 months ago
2008
As more and more genomes are sequenced, evolutionary biologists are becoming increasingly interested in evolution at the level of whole genomes, in scenarios in which the genome e...
91
Voted
DEXAW
2006
IEEE
15 years 3 months ago
2006
IEEE
Detecting structural similarities between XML documents has been the subject of several recent work, and the proposed algorithms mostly use tree edit distance between the correspo...