Revision as of 21:56, 21 July 2005 edit Nils Grimsmo (talk \| contribs) 567 edits Added more "to the point" introduction. Example formatting. You search for something that _might_ be a substring. Added refecences. ← Previous edit		Revision as of 22:41, 10 September 2005 edit undo 209.234.66.97 (talk) No edit summary Next edit →
Line 37: ==References== * Udi Manber and Gene Myers (1991). "Suffix arrays: a new method for on-line string searches". ''SIAM Journal on Computing'', Volume 22, Issue 5 (October 1993), pp. 935-948. * Pang Ko and Srinivas Aluru (2003). "Space efficient linear time construction of suffix arrays." In ''Combinatorial Pattern Matching (CPM 03)''. LNCS 2676, Springer, 2003, pp 203-210. * 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 ALENEX'', 2005.

Suffix array: Difference between revisions