See this document in CiteSeerX!

Bit-parallel (δ,γ)-Matching and Suffix Automata  (Make Corrections)  
Maxime Crochemore, Costas S. Iliopoulos, Gonzalo Navarro, Yoan J. Pinzon, Alejandro Salinger



  Home/Search   Context   Related

 
View or download:
dcc.uchile.cl/~gnavarro/p...jda04.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  dcc.uchile.cl/~gnavarro/publ (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: 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) -P # i #, and (ii) #. 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(n log(#)/w) worst-case time and O(n) average-case time... (Update)

Active bibliography (related documents):   More   All
2.8:   A Bit-parallel Suffix Automaton Approach for.. - Crochemore..   (Correct)
0.8:   Transposition Invariant String Matching - Mäkinen, Navarro, Ukkonen (2004)   (Correct)
0.6:   Matching Numeric Strings under Noise - Mäkinen, Navarro, Ukkonen   (Correct)

Similar documents based on text:   More   All
0.6:   Algorithms for Computing Approximate Repetitions.. - Cambouropoulos.. (1999)   (Correct)
0.5:   Fast Evolutionary Chains - Crochemore, Iliopoulos, Pinzon   (Correct)
0.4:   A Fast and Practical Bit-Vector Algorithm for the.. - Crochemore.. (2000)   (Correct)

BibTeX entry:   (Update)

@misc{ crochemore-bitparallel,
  author = "Maxime Crochemore and Costas S. Iliopoulos and Gonzalo Navarro and Yoan
    J. Pinzon and Alejandro Salinger",
  title = "Bit-parallel (δ,γ)-Matching and Suffix Automata",
  url = "citeseer.ist.psu.edu/691421.html" }
Citations (may not include all citations):
214   A fast string searching algorithm (context) - Boyer, Moore - 1977
204   Oxford University Press (context) - Crochemore, Rytter - 1994
196   Fast text searching allowing errors (context) - Wu, Manber - 1992
59   Speeding up two string-matching algorithms (context) - Czumaj, Crochemore et al. - 1994
39   String matching techniques for musical similarity and melodi.. (context) - Crawford, Iliopoulos et al. - 1998
35   Faster approximate string matching (context) - Baeza-Yates, Navarro - 1999
32   A new approach to text searching (context) - Baeza-Yates, Gonnet - 1992
22   Algorithms for computing approximate repetitions in musical .. - Cambouropoulos, Crochemore et al. - 2002
22   Algorithms for computing approximate repetitions in musical .. - Cambouropoulos, Crochemore et al. - 1999
21   Flexible Pattern Matching in Strings -- Practical on-line se.. (context) - Navarro, Ra - 2002
19   Musical pattern extraction and similarity assessment (context) - Roland, Ganascia - 2000
16   Pattern processing in melodic sequences: Challenges (context) - Cambouropoulos, Crawford et al. - 1999
13   Text retrieval: Theory and practice (context) - Baeza-Yates - 1992
13   Fast and flexible string matching by combining bitparallelis.. - Navarro, Ra - 2000
12   MIDIMatch: Musical Pattern Matching in Real Time (context) - McGettrick - 1997
10   Approximate string matching over su#x trees - Ukkonen - 1993
7   Improving an algorithm for approximate string matching (context) - Navarro, Baeza-Yates - 2001
4   A bit-parallel su#x automaton approach (context) - Crochemore, Iliopoulos et al. - 2003
4   Three heuristics for #-matching: #-BM algorithms (context) - Crochemore, Iliopoulos et al. - 2002
4   cient bit-parallel techniques for transposition invariant ap.. (context) - Lemstrom, Navarro - 2003
3   Fast string matching with mismatches (context) - Baeza-Yates, Gonnet - 1994
2   A very fast substring searching algorithm (context) - Sunday - 1990
2   Occurence and substring heuristics for #-matching (context) - Crochemore, Iliopoulos et al. - 2003
2   A speech interface for building musical score collections (context) - Smith, Chiu et al. - 2000

Documents on the same site (http://www.dcc.uchile.cl/~gnavarro/publ.html):   More
A More Precise Solution to Two Problems on Tries - Navarro, Poblete   (Correct)
Fast Approximate String Matching in a Dictionary - Baeza-Yates, Navarro (1998)   (Correct)
An Optimal Index for PAT Arrays - Navarro (1996)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC