Bit-parallel ( δ , γ )-Matching and Suffix Automata ⋆

@inproceedings{Crochemore2008Bitparallel,
  title={Bit-parallel ( δ , γ )-Matching and Suffix Automata ⋆},
  author={Maxime Crochemore and Costas S. Iliopoulos and Gonzalo Navarro and Yoan J. Pinz{\'o}n and Alejandro Salinger},
  year={2008}
}
(δ, γ)-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… CONTINUE READING
2 Citations
24 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 24 references

Similar Papers

Loading similar papers…