Quote: use compressed suffix arrays and trees to search for short strings in O(1) time with O(n) space

Quotation Skeleton

Searching unstructured text for string matching queries, however, … that of structured texts because it consists of … In the rest of the paper, we assumed … [p. 404] We have presented the first index structure … n log n) bits for fast text searching. … bits to index a text string T of … number of occurrences of P in T in … = o(m) times for m=.atLeast.(log n) and any …   Google-1   Google-2

Copyright clearance needed for quotation.

Related Topics

Topic: search algorithms (40 items)
Topic: suffix trie and suffix array (20 items)