Jump to content

Talk:Suffix array

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by AlcoholVat (talk | contribs) at 06:31, 24 January 2009 (Suggestion: add articles for O(nlogn) and O(n) algorithms.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Suggestion: add articles for O(nlogn) and O(n) algorithms.

I searched for both Doubling Algorithm(which runs in O(nlogn) time) and Skew Algorithm(a.k.a. DC3, Difference Cover modulo 3), and there's no result. As an important data structure in string processing I think these two algorithms should be covered. I'm no expert so anyone willing to help? Actually I am named BNJ representing Benjamin Jones. But that name is occupied. (talk) 06:31, 24 January 2009 (UTC)[reply]

Retrieved from "https://en.wikipedia.org/w/index.php?title=Talk:Suffix_array&oldid=266069492"