| 
|
QuoteRef: coleR9_2002
topics >
all references >
Topic:
suffix trie and suffix array
Topic:
approximate string matching and pattern matching with errors
Reference
Cole, R., Hariharan, R., "Approximate string matching: a simpler faster algorithm", SIAM Journal of Computing, 31, 6, September 2002, pp. 1761-1782. Google
abstract ;;Quote: simple, fast algorithm for approximate string matching; special cases k-break periodic strings; uses suffix tree; short, overlapping text partitions; pattern at least 5k^3 where k is the maximum edit distance
Topic: suffix trie and suffix array (20 items)
Topic: approximate string matching and pattern matching with errors (19 items)