Searching for "Suffix Tree and String Complexity." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

2 documents found, showing 1 through 2.

Suffix Trees and String Complexity
by Luke O'Connor, Tim Snider — 1992 — Advances in Cryptology: Proc. of EUROCRYPT, LNCS 658
…Suffix trees and string complexity Luke O'Connor Tim Snider Department of Computer Science…
Cited by 3 (0 self) – Add To MetaCart

Efficient Parallel And Serial Approximate String Matching
by Gad M. Landau, Uzi Vishkin — 1986
… for this string. Complexity. [W-73] computes the suffixes tree in O(n) time when the size of the alphabet…
Add To MetaCart

Showing 1 through 2.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB