Revision as of 12:42, 19 November 2006 edit Malcolm rowe (talk \| contribs) 71 edits Indexing base is unimportant; no need to mention both possibilities ← Previous edit		Revision as of 23:11, 29 January 2007 edit undo Malbrain (talk \| contribs) Extended confirmed users 550 edits →References Next edit →
Line 40: * Juha Kärkkäinen and Peter Sanders (2003). "Simple linear work suffix array construction." In ''Proc. 30th International Colloquium on Automata, Languages and Programming (ICALP '03)''. LNCS 2719, Springer, 2003, pp. 943-955. * Klaus-Bernd Schürmann and Jens Stoye (2005). "An incomplex algorithm for fast suffix array construction". In ''Proceedings of the 7th Workshop on Algorithm Engineering and Experiments and the 2nd Workshop on Analytic Algorithmics and Combinatorics (ALENEX/ANALCO 2005)'', 2005, pp. 77-85. ==External links== *[http://geocities.com/malbrain/bwtsort_c.html Suffix sorting module for BWT in C code] [[Category:Arrays]]

Suffix array: Difference between revisions