| 
|
Quote: use trie methods for k-approximate string matching; 4 times faster than agrep for k=1, otherwise slower
topics >
all references >
references sa-sz >
Topic:
approximate string matching and pattern matching with errors
Quotation Skeleton
In this paper, we have expanded trie methods … k differences in a very large set of … … Our algorithm searches a trie depth first with … Our trie method outperforms agrep … by a factor of 4 for k=1. [It is slower than agrep for k>=2 in moderately large documents.] Google-1 Google-2
Copyright clearance needed for quotation.
Topic: approximate string matching and pattern matching with errors (19 items)