Sciweavers

247 search results - page 3 / 50
» Incremental String Comparison
Sort
View
SODA
2010
ACM
149views Algorithms» more  SODA 2010»
15 years 6 months ago
Data-Specific Analysis of String Sorting
We consider the complexity of sorting strings in the model that counts comparisons between symbols and not just comparisons between strings. We show that for any set of strings S ...
Raimund Seidel
BMCBI
2008
71views more  BMCBI 2008»
14 years 9 months ago
An improved string composition method for sequence comparison
Background: Historically, two categories of computational algorithms (alignment-based and alignment-free) have been applied to sequence comparison
Guoqing Lu, Shunpu Zhang, Xiang Fang
CICLING
2009
Springer
14 years 10 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...
IJCAI
2003
14 years 10 months ago
A Comparison of String Distance Metrics for Name-Matching Tasks
Using an open-source, Java toolkit of name-matching methods, we experimentally compare string distance metrics on the task of matching entity names. We investigate a number of dif...
William W. Cohen, Pradeep D. Ravikumar, Stephen E....
ICALP
2004
Springer
15 years 2 months ago
A General Technique for Managing Strings in Comparison-Driven Data Structures
Abstract. This paper presents a general technique for optimally transforming any dynamic data structure D that operates on atomic and indivisible keys by constant-time comparisons,...
Gianni Franceschini, Roberto Grossi