@inproceedings{6c364d1deb80475793ea1eb3ffe13d87,
title = "Jump-matching with errors",
abstract = "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.",
author = "Ayelet Butman and Noa Lewenstein and Benny Porat and Ely Porat",
year = "2007",
doi = "10.1007/978-3-540-75530-2\_9",
language = "אנגלית",
isbn = "9783540755296",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "98--106",
booktitle = "String Processing and Information Retrieval - 14th International Symposium, SPIRE 2007, Proceedings",
address = "גרמניה",
note = "14th International Symposium on String Processing and Information Retrieval, SPIRE 2007 ; Conference date: 29-10-2007 Through 31-10-2007",
}