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 92.230.235.192 (talk) at 14:29, 22 October 2010 (argorithm mistake). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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]

Lack of citations

We could use citations in a few places. We have references at the bottom, but no notes in the text. I'll fix when I have time. 70.68.169.53 (talk) 04:21, 20 October 2009 (UTC)[reply]

That was me. Blowfish (talk) 04:22, 20 October 2009 (UTC)[reply]

Algorithm

else if W > suffixAt(pos[m-1]) then ans = m seems to be wrong. it think it is else if W > suffixAt(pos[n-1]) then ans = n

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