55 search results - page 7 / 11 » More Efficient Algorithms for Closest String and Substring P... |
CATS
2006
13 years 10 months ago
2006
Some combinatorial generation problems can be broken into subproblems for which loopless algorithms already exist. We discuss means by which loopless algorithms can be fused to pr...
FOCS
2004
IEEE
14 years 8 days ago
2004
IEEE
Edit distance has been extensively studied for the past several years. Nevertheless, no linear-time algorithm is known to compute the edit distance between two strings, or even to...
FUN
2010
Springer
14 years 1 months ago
2010
Springer
Given a string s, the Parikh vector of s, denoted p(s), counts the multiplicity of each character in s. Searching for a match of Parikh vector q (a “jumbled string”) in the tex...
SIGMOD
2008
ACM
13 years 8 months ago
2008
ACM
Today's record matching infrastructure does not allow a flexible way to account for synonyms such as "Robert" and "Bob" which refer to the same name, and ...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
A string matching--and more generally, sequence matching--algorithm is presented that has a linear worst-case computing time bound, a low worst-case bound on the number of compari...