Bit-parallel (γ,δ)-matching and suffix automata - Archive ouverte HAL Access content directly
Journal Articles Journal of Discrete Algorithms Year : 2005

Bit-parallel (γ,δ)-matching and suffix automata


(δ,γ)-matching is a string matching problem with applications to music retrieval. The goal is, given a pattern P1...m and a text T1...n on an alphabet of integers, find the occurrences P′ of the pattern in the text such that (i) ∇1≤i≤m, |Pi-P'i|≤δ and (ii) ∑1≤i≤m|Pi-P'i|≤γ. The problem makes sense for δ≤γ≤δm. Several techniques for (δ,γ)-matching have been proposed, based on bit-parallelism or on skipping characters. We first present an O(mn log(γ) / w) worst-case time and O(n) average-case time bit-parallel algorithm (being w the number of bits in the computer word). It improves the previous O(mn log(δm) / w) worst-case time algorithm of the same type. Second, we combine our bit-parallel algorithm with suffix automata to obtain the first algorithm that skips characters using both δ and γ. This algorithm examines less characters than any previous approach, as the others do just δ-matching and check the γ-condition on the candidates. We implemented our algorithms and drew experimental results on real music, showing that our algorithms are superior to current alternatives with high values of δ.
Fichier principal
Vignette du fichier
jda04.pdf (263.35 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00619564 , version 1 (15-07-2013)



Maxime Crochemore, Costas S. Iliopoulos, Gonzalo Navarro, Yoan Pinzon, Alejandro Salinger. Bit-parallel (γ,δ)-matching and suffix automata. Journal of Discrete Algorithms, 2005, 3 (2-4), pp.198-214. ⟨10.1016/j.jda.2004.08.005⟩. ⟨hal-00619564⟩
296 View
358 Download



Gmail Facebook Twitter LinkedIn More