@inbook{b43103cacd2946f984b743e14d2bd073,
title = "A bit-parallel suffix automaton approach for (delta, gamma)-matching in music retrieval",
abstract = "(delta, gamma)-Matching is a string matching problem with applications to music retrieval. The goal is, given a pattern P-1...m and a text T-1...n on an alphabet of integers, find the occurrences P' of the pattern in the text such that (i) For All1 less than or equal to i less than or equal to m, \P-i - P-i'\ less than or equal to delta, and (ii) Sigma(1less than or equal toiless than or equal tom) \P-i - P-i'\ less than or equal to gamma. Several techniques for (delta, gamma)-matching have been proposed. In this paper we show that a classical string matching technique that combines bit-parallelism and suffix automata can be successfully adapted to this problem. This is the first character-skipping algorithm that skips characters using both delta and gamma. We implemented our algorithm and drew experimental results on real music showing that our algorithm is superior to current alternatives.",
author = "Nascimento, {M A} and DeMoura, {E S} and Oliveira, {A L} and Pinzon, {Y J}",
year = "2003",
language = "English",
isbn = "3-540-20177-7",
series = "LECTURE NOTES IN COMPUTER SCIENCE",
publisher = "Springer",
pages = "211 -- 223",
booktitle = "LECT NOTE COMPUT SCI",
note = "10th International Symposium on String Processing and Information Retrieval ; Conference date: 01-01-2003",
}