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

( δ , γ ) -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) ∀ 1 ⩽ i ⩽ m , | P i − P i ′ | ⩽ δ , and (ii) ∑ 1 ⩽ i ⩽ m | P i...

Full description

Bibliographic Details

Published in:	Journal of discrete algorithms (Amsterdam, Netherlands) Vol. 3; no. 2; pp. 198 - 214
Main Authors:	Crochemore, Maxime, Iliopoulos, Costas S., Navarro, Gonzalo, Pinzon, Yoan J., Salinger, Alejandro
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 2005 Elsevier
Subjects:	Approximate string matching Bit-parallelism Computer Science Data Structures and Algorithms MIDI music retrieval Approximate string matching Bit-parallelism MIDI music retrieval approximate string matching bit-parallelism
ISSN:	1570-8667, 1570-8675
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!