TY - GEN
T1 - A black box for online approximate pattern matching
AU - Clifford, Raphaël
AU - Efremenko, Klim
AU - Porat, Benny
AU - Porat, Ely
PY - 2008/7/1
Y1 - 2008/7/1
N2 - We present a deterministic black box solution for online approximate matching. Given a pattern of length m and a streaming text of length n that arrives one character at a time, the task is to report the distance between the pattern and a sliding window of the text as soon as the new character arrives. Our solution requires time for each input character, where T(n,m) is the total running time of the best offline algorithm. The types of approximation that are supported include exact matching with wildcards, matching under the Hamming norm, approximating the Hamming norm, k-mismatch and numerical measures such as the L 2 and L 1 norms. For these examples, the resulting online algorithms take O(log2 m), O(√m log m), O(log 2 m/ε 2), O(√k log k log m) O(log2 m) and O(√m log m) time per character respectively. The space overhead is O(m) which we show is optimal.
AB - We present a deterministic black box solution for online approximate matching. Given a pattern of length m and a streaming text of length n that arrives one character at a time, the task is to report the distance between the pattern and a sliding window of the text as soon as the new character arrives. Our solution requires time for each input character, where T(n,m) is the total running time of the best offline algorithm. The types of approximation that are supported include exact matching with wildcards, matching under the Hamming norm, approximating the Hamming norm, k-mismatch and numerical measures such as the L 2 and L 1 norms. For these examples, the resulting online algorithms take O(log2 m), O(√m log m), O(log 2 m/ε 2), O(√k log k log m) O(log2 m) and O(√m log m) time per character respectively. The space overhead is O(m) which we show is optimal.
UR - http://www.scopus.com/inward/record.url?scp=45849089972&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-69068-9_15
DO - 10.1007/978-3-540-69068-9_15
M3 - Conference contribution
AN - SCOPUS:45849089972
SN - 3540690662
SN - 9783540690665
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 143
EP - 151
BT - Combinatorial Pattern Matching - 19th Annual Symposium, CPM 2008, Proceedings
T2 - 19th Annual Symposium on Combinatorial Pattern Matching, CPM 2008
Y2 - 18 June 2008 through 20 June 2008
ER -