A bit-parallel approach to suffix automata: Fast extended string matching

This publication has 16 references indexed in Scilit:

• A Comparison of Approximate String Matching Algorithms
  Software: Practice and Experience, 1996
• A subquadratic algorithm for approximate limited expression matching
  Algorithmica, 1996
• A faster algorithm for approximate string matching
  1996
• Theoretical and empirical comparisons of approximate string matching algorithms
  1992
• A very fast substring search algorithm
  Communications of the ACM, 1990
• Average sizes of suffix trees and DAWGs
  Discrete Applied Mathematics, 1989
• Transducers and repetitions
  Theoretical Computer Science, 1986
• Practical fast searching in strings
  Software: Practice and Experience, 1980
• A fast string searching algorithm
  Communications of the ACM, 1977
• Fast Pattern Matching in Strings
  SIAM Journal on Computing, 1977