Map
Index
Random
Help
th

Quote: faster string matching by partitioning text into segments of the pattern length; search by hashing; requires linked lists and more memory

topics > all references > references i-l > QuoteRef: kimS_1999 , p. abstract



Topic:
pattern matching

Quotation Skeleton

In this paper, we present a new string-pattern … [ALGO1, ALGO2] … occurrences using a simple hashing scheme. Unlike the … conceptually simpler way to search for patterns. Empirical … algorithm. … [p. 3] Non-occurrence heuristic: Assume that we partition text … If the last character in a segment does … [p. 10] The increased speed of our algorithm may … [p. 17] The drawbacks of our algorithm is the … and the necessity of maintaining linked lists   Google-1   Google-2

Copyright clearance needed for quotation.


Related Topics up

Topic: pattern matching (42 items)

Copyright © 2002-2008 by C. Bradford Barber. All rights reserved.
Thesa is a trademark of C. Bradford Barber.