Sciweavers

51 search results - page 6 / 11
» Approximate String Matching in LDAP Based on Edit Distance
Sort
View
JCB
2002
111views more  JCB 2002»
13 years 6 months ago
A General Edit Distance between RNA Structures
Arc-annotated sequences are useful in representing the structural information of RNA sequences. In general, RNA secondary and tertiary structures can be represented as a set of ne...
Tao Jiang, Guohui Lin, Bin Ma, Kaizhong Zhang
PVLDB
2008
201views more  PVLDB 2008»
13 years 6 months ago
Ed-Join: an efficient algorithm for similarity joins with edit distance constraints
There has been considerable interest in similarity join in the research community recently. Similarity join is a fundamental operation in many application areas, such as data inte...
Chuan Xiao, Wei Wang 0011, Xuemin Lin
CICLING
2009
Springer
13 years 7 months ago
Generalized Mongue-Elkan Method for Approximate Text String Comparison
Abstract. The Mongue-Elkan method is a general text string comparison method based on an internal character-based similarity measure (e.g. edit distance) combined with a token leve...
Sergio Jimenez, Claudia Becerra, Alexander F. Gelb...
SIGMOD
2010
ACM
228views Database» more  SIGMOD 2010»
13 years 11 months ago
Probabilistic string similarity joins
Edit distance based string similarity join is a fundamental operator in string databases. Increasingly, many applications in data cleaning, data integration, and scientific compu...
Jeffrey Jestes, Feifei Li, Zhepeng Yan, Ke Yi
ICDE
2010
IEEE
371views Database» more  ICDE 2010»
14 years 6 months ago
TASM: Top-k Approximate Subtree Matching
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
Nikolaus Augsten, Denilson Barbosa, Michael H. B&o...