Editing Suffix array (section)

== References ==
* {{cite conference
 | title = Suffix arrays: a new method for on-line string searches
 | year = 1990
 | conference = First Annual ACM-SIAM Symposium on Discrete Algorithms
 | pages = 319–327
 | url = http://dl.acm.org/citation.cfm?id=320176.320218
 | last1 = Manber	 | first1 =  Udi | author1-link = Udi Manber
 | last2 = Myers	 | first2 =  Gene | author2-link = Gene Myers
}}
* {{cite journal
 | title = Suffix arrays: a new method for on-line string searches
 | year = 1993
 | journal = SIAM Journal on Computing
 | volume = 22
 | issue = 5
 | pages = 935–948
 | doi = 10.1137/0222058
 | url = http://dl.acm.org/citation.cfm?id=320176.320218
 | last1 = Manber	 | first1 =  Udi | author1-link = Udi Manber
 | last2 = Myers	 | first2 =  Gene | s2cid = 5074629
 | author2-link = Gene Myers
}}
* {{cite conference |last1=Li|first1=Zhize|last2=Li|first2=Jian|last3=Huo|first3=Hongwei 
|doi = 10.1007/978-3-030-00479-8_22
|title = Optimal In-Place Suffix Sorting
|arxiv = 1610.08305
|conference = Proceedings of the 25th International Symposium on String Processing and Information Retrieval (SPIRE)
|series = Lecture Notes in Computer Science
|publisher = Springer
|year = 2016
|isbn = 978-3-030-00478-1
|volume = 11147
|pages = 268–284 
}}
* {{cite conference|last1=Shi|first1=Fei|title=Concurrency and Parallelism, Programming, Networking, and Security |chapter=Suffix arrays for multiple strings: A method for on-line multiple string searches|date=1996|series=Lecture Notes in Computer Science|volume=1179 |publisher=Springer Berlin Heidelberg |pages=11–22|doi=10.1007/BFb0027775|isbn=978-3-540-62031-0}}
* {{cite conference
 | doi = 10.1007/3-540-45784-4_35|title=The Enhanced Suffix Array and Its Applications to Genome Analysis |conference=Algorithms in Bioinformatics|series=[[Lecture Notes in Computer Science]]|year=2002 |last1=Abouelhoda|first1=Mohamed Ibrahim|last2=Kurtz|first2=Stefan|last3=Ohlebusch|first3=Enno|isbn=978-3-540-44211-0|volume=2452}}
* {{cite journal
 | doi=10.1016/S1570-8667(03)00065-0
 | title=Replacing suffix trees with enhanced suffix arrays
 | date=March 2004
 | last1=Abouelhoda | first1=Mohamed Ibrahim
 | last2=Kurtz | first2=Stefan
 | last3=Ohlebusch | first3=Enno
 | journal=Journal of Discrete Algorithms
 | volume=2
 | issue=1
 | pages=53–86| doi-access=free
 | issn=1570-8667
 }}
* {{cite journal
 | title = New indices for text: PAT trees and PAT arrays
 | year = 1992
 | journal = Information Retrieval: Data Structures and Algorithms
 | last1 = Gonnet	 | first1 =  G.H.
 | last2 =  Baeza-Yates	 | first2 =  R.A.
 | last3 = Snider        | first3 = T.
 | url = http://orion.lcg.ufrj.br/Dr.Dobbs/books/book5/chap05.htm
}}
* {{cite journal
 | title = Reducing the space requirement of suffix trees
 | year = 1999
 | journal = Software: Practice and Experience
 | volume = 29
 | issue = 13
 | last1 = Kurtz | first1 =  S
 | doi=10.1002/(SICI)1097-024X(199911)29:13<1149::AID-SPE274>3.0.CO;2-O
 | pages=1149–1171
| hdl = 10338.dmlcz/135448
 | hdl-access = free
 }}
* {{cite journal
 | doi = 10.1145/1242471.1242472|title=A taxonomy of suffix array construction algorithms|year=2007|last1=Puglisi|first1=Simon J.|last2=Smyth|first2=W. F.|last3=Turpin|first3=Andrew H.|journal=ACM Computing Surveys|volume=39|issue=2|pages=4
| s2cid = 2653529| url = http://researchrepository.murdoch.edu.au/id/eprint/27889/}}
* {{cite conference
 | doi = 10.1109/DCC.2009.42|title=Linear Suffix Array Construction by Almost Pure Induced-Sorting|conference=2009 Data Compression Conference|year=2009|last1=Nong|first1=Ge|last2=Zhang|first2=Sen|last3=Chan|first3=Wai Hong|isbn=978-0-7695-3592-0|pages=193
}}
* {{cite conference
 | doi = 10.1007/978-3-642-22300-6_32|title=Inducing the LCP-Array|conference=Algorithms and Data Structures|series=Lecture Notes in Computer Science|year=2011|last1=Fischer|first1=Johannes|isbn=978-3-642-22299-3|volume=6844|pages=374–385
|arxiv=1101.3448}}
* {{cite journal
 | doi = 10.1016/j.jda.2009.02.007|title=Dynamic extended suffix arrays|year=2010|last1=Salson|first1=M.|last2=Lecroq|first2=T.|last3=Léonard|first3=M.|last4=Mouchard|first4=L.|journal=Journal of Discrete Algorithms|volume=8|issue=2|pages=241
|doi-access=free}}
* {{cite conference
  | doi = 10.1007/3-540-44888-8_5|title=Fast Lightweight Suffix Array Construction and Checking|conference=Combinatorial Pattern Matching|series=Lecture Notes in Computer Science|year=2003|last1=Burkhardt|first1=Stefan|last2=Kärkkäinen|first2=Juha|isbn=978-3-540-40311-1|volume=2676|pages=55–69
}}
* {{cite conference
  | doi=10.1145/800152.804905|title=Rapid identification of repeated patterns in strings, trees and arrays |conference=Proceedings of the fourth annual ACM symposium on Theory of computing - STOC '72|year=1972 |last1=Karp|first1=Richard M.|last2=Miller|first2=Raymond E.|last3=Rosenberg|first3=Arnold L.|pages=125–136
}}
* {{cite conference
  | doi = 10.1109/SFCS.1997.646102|title=Optimal suffix tree construction with large alphabets |conference=Proceedings 38th Annual Symposium on Foundations of Computer Science|year=1997 |last1=Farach|first1=M.|isbn=0-8186-8197-7
}}
* {{cite conference|last1=I|first1=Tomohiro|last2=Kärkkäinen|first2=Juha|last3=Kempa|first3=Dominik|title=Faster Sparse Suffix Sorting |date=2014|series=Leibniz International Proceedings in Informatics (LIPIcs) |volume=25 |pages=386–396 |publisher=Schloss Dagstuhl – Leibniz-Zentrum fuer Informatik |doi=10.4230/LIPIcs.STACS.2014.386 |doi-access=free |isbn=978-3-939897-65-1
}}
* {{cite conference
  | doi = 10.1007/3-540-45061-0_73|title=Simple Linear Work Suffix Array Construction|conference=Automata, Languages and Programming|series=Lecture Notes in Computer Science|year=2003 |last1=Kärkkäinen|first1=Juha|last2=Sanders|first2=Peter|author2-link=Peter Sanders (computer scientist)|isbn=978-3-540-40493-4|volume=2719
}}
* {{cite journal
  | doi = 10.1145/1227161.1402296|title=Better external memory suffix array construction|year=2008 |last1=Dementiev|first1=Roman|last2=Kärkkäinen|first2=Juha|last3=Mehnert|first3=Jens|last4=Sanders |first4=Peter|author4-link=Peter Sanders (computer scientist)|journal=Journal of Experimental Algorithmics |volume=12|pages=1–24| s2cid=12296500| url=https://publikationen.bibliothek.kit.edu/1000009446}}
* {{cite journal
  | doi = 10.1016/j.parco.2007.06.004|title=Scalable parallel suffix array construction|year=2007 |last1=Kulla|first1=Fabian|last2=Sanders|first2=Peter|author2-link=Peter Sanders (computer scientist) |journal=Parallel Computing |volume=33|issue=9
|pages=605–612 }}
*Mohamed Ibrahim Abouelhoda, Stefan Kurtz, and Enno Ohlebusch. "Replacing suffix trees with enhanced suffix arrays." ''Journal of Discrete Algorithms'', 2(1):53–86, 2004.
*Dong Kyue Kim, Jeong Eun Jeon, and Heejin Park. "An efficient index data structure with the capabilities of suffix trees and suffix arrays for alphabets of non-negligible size." ''String Processing and Information Retrieval Lecture Notes in Computer Science'', page138–149, 2004.