Sciweavers

421 search results - page 8 / 85
» String Distances and Uniformities
Sort
View
SPIRE
2010
Springer
13 years 5 months ago
Why Large Closest String Instances Are Easy to Solve in Practice
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
Christina Boucher, Kathleen Wilkie
FECS
2006
113views Education» more  FECS 2006»
13 years 8 months ago
A Lightweight Program Similarity Detection Model using XML and Levenshtein Distance
Program plagiarism is one of the most significant problems in Computer Science education. Most common plagiarism includes modifying comments, reordering statements, and changing v...
Seo-Young Noh, Sangwoo Kim, Cheonyoung Jung
SIGMOD
2010
ACM
228views Database» more  SIGMOD 2010»
14 years 5 days 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
JDA
2008
87views more  JDA 2008»
13 years 7 months ago
Lossless filter for multiple repetitions with Hamming distance
Similarity search in texts, notably in biological sequences, has received substantial attention in the last few years. Numerous filtration and indexing techniques have been create...
Pierre Peterlongo, Nadia Pisanti, Fréd&eacu...