TY - GEN
T1 - Jump-matching with errors
AU - Butman, Ayelet
AU - Lewenstein, Noa
AU - Porat, Benny
AU - Porat, Ely
PY - 2007
Y1 - 2007
N2 - Two equal-length integer-value strings jump-match if each of their corresponding (locationwise) elements differ by the same value d. In Jump matching one seeks all text substrings which jump-match the pattern. Strings approximate jump-match if all elements differ by the same value asides from at most k, where k is predefined. In approximate jump-matching one seeks the text substrings which approximate jumpmatch with the pattern. We present innovative, efficient deterministic and randomized algorithms to solve the approximate jump-matching problem.
AB - Two equal-length integer-value strings jump-match if each of their corresponding (locationwise) elements differ by the same value d. In Jump matching one seeks all text substrings which jump-match the pattern. Strings approximate jump-match if all elements differ by the same value asides from at most k, where k is predefined. In approximate jump-matching one seeks the text substrings which approximate jumpmatch with the pattern. We present innovative, efficient deterministic and randomized algorithms to solve the approximate jump-matching problem.
UR - http://www.scopus.com/inward/record.url?scp=38049074960&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-75530-2_9
DO - 10.1007/978-3-540-75530-2_9
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:38049074960
SN - 9783540755296
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 98
EP - 106
BT - String Processing and Information Retrieval - 14th International Symposium, SPIRE 2007, Proceedings
PB - Springer Verlag
T2 - 14th International Symposium on String Processing and Information Retrieval, SPIRE 2007
Y2 - 29 October 2007 through 31 October 2007
ER -