Suffix array: Difference between revisions

Content deleted Content added
mNo edit summary
Line 39:
* 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 the 7th Workshop on Algorithm Engineering and Experiments and the 2nd Workshop on Analytic Algorithmics and Combinatorics ({ALENEX}/{ANALCO} 2005)'', 2005, pp. 77-85.
 
[[Category:Arrays]]