Sciweavers

179 search results - page 4 / 36
» An Optimal Decomposition Algorithm for Tree Edit Distance
Sort
View
WWW
2004
ACM
15 years 10 months ago
Automatic web news extraction using tree edit distance
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...
Davi de Castro Reis, Paulo Braz Golgher, Altigran ...
82
Voted
STRINGOLOGY
2004
14 years 11 months ago
A Note on Bit-Parallel Alignment Computation
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...
Heikki Hyyrö
SODA
2010
ACM
181views Algorithms» more  SODA 2010»
14 years 7 months ago
Near-Optimal Sublinear Time Algorithms for Ulam Distance
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...
Alexandr Andoni, Huy L. Nguyen
78
Voted
JEA
2008
97views more  JEA 2008»
14 years 9 months ago
Approximating the true evolutionary distance between two genomes
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...
Krister M. Swenson, Mark Marron, Joel V. Earnest-D...
91
Voted
DEXAW
2006
IEEE
111views Database» more  DEXAW 2006»
15 years 3 months ago
Finding Syntactic Similarities Between XML Documents
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...
Davood Rafiei, Daniel L. Moise, Dabo Sun