Editing Suffix tree (section)

==References==
*{{citation
 | isbn=0-201-00029-6
 | last1 = Aho | first1=Alfred V. | author1-link = Alfred Aho
 | last2 = Hopcroft | first2=John E. | author2-link = John Hopcroft
 | last3 = Ullman | first3= Jeffrey D. | author3-link = Jeffrey Ullman
 | title=The Design and Analysis of Computer Algorithms
 | location=Reading/MA
 | publisher=Addison-Wesley
 | year=1974| bibcode = 1974daca.book.....A }}.
*{{citation
 | last1 = Apostolico | first1 = A.
 | last2 = Iliopoulos | first2 = C.
 | last3 = Landau | first3 = G. M.
 | last4 = Schieber | first4 = B.
 | last5 = Vishkin | first5 = U.
 | title = Parallel construction of a suffix tree with applications
 | journal = Algorithmica
 | url = http://docs.lib.purdue.edu/cgi/viewcontent.cgi?article=1617&context=cstech
 | volume = 3
 | issue = 1–4
 | pages = 347–365
 | year = 1988
 | doi = 10.1007/bf01762122| s2cid = 5024136
 }}.
*{{citation
 | last1 = Baeza-Yates | first1 = Ricardo A. | author1-link = Ricardo Baeza-Yates
 | last2 = Gonnet | first2 = Gaston H. | author2-link = Gaston Gonnet
 | doi = 10.1145/235809.235810
 | issue = 6
 | journal = [[Journal of the ACM]]
 | pages = 915–936
 | title = Fast text searching for regular expressions or automaton searching on tries
 | volume = 43
 | year = 1996| s2cid = 1420298 | doi-access = free
 }}.
*{{citation
 | last1 = Barsky | first1 = Marina
 | last2 = Stege | first2 = Ulrike
 | last3 = Thomo | first3 = Alex
 | last4 = Upton | first4 = Chris
 | contribution = A new method for indexing genomes using on-disk suffix trees
 | location = New York, NY, USA
 | pages = 649–658
 | publisher = ACM
 | title = CIKM '08: Proceedings of the 17th ACM Conference on Information and Knowledge Management
 | year = 2008
 | url = http://webhome.cs.uvic.ca/~thomo/papers/cikm08suffixtrees.pdf}}.
*{{citation
 | last1 = Barsky | first1 = Marina
 | last2 = Stege | first2 = Ulrike
 | last3 = Thomo | first3 = Alex
 | last4 = Upton | first4 = Chris
 | contribution = Suffix trees for very large genomic sequences
 | location = New York, NY, USA
 | publisher = ACM
 | title = CIKM '09: Proceedings of the 18th ACM Conference on Information and Knowledge Management
 | year = 2009
 | url = http://csci.viu.ca/~barskym/publications/CIKMconference2008.pdf}}.
*{{citation |last=Farach |first=Martin |author-link=Martin Farach-Colton |title=38th IEEE Symposium on Foundations of Computer Science (FOCS '97) |pages=137–143 |contribution=Optimal Suffix Tree Construction with Large Alphabets |contribution-url=https://users.cs.utah.edu/~pandey/courses/cs6968/spring23/papers/optsuffixtree.pdf |year=1997 |title-link=Symposium on Foundations of Computer Science}}.
*{{citation
 | last1 = Farach | first1 = Martin | author1-link = Martin Farach-Colton
 | last2 = Muthukrishnan | first2 = S. | author2-link = S. Muthukrishnan (computer scientist)
 | title = International Colloquium on Automata Languages and Programming
 | contribution = Optimal Logarithmic Time Randomized Suffix Tree Construction
 | year = 1996
 | url = https://people.cs.rutgers.edu/~farach/pubs/PRAMSuffixICALP.pdf}}.
*{{citation
 | last1 = Farach-Colton | first1 = Martin  | author1-link = Martin Farach-Colton
 | last2 = Ferragina | first2 = Paolo
 | last3 = Muthukrishnan | first3 = S. | author3-link = S. Muthukrishnan (computer scientist)
 | doi = 10.1145/355541.355547
 | issue = 6
 | journal = Journal of the ACM
 | pages = 987–1011
 | title = On the sorting-complexity of suffix tree construction.
 | volume = 47
 | year = 2000| s2cid = 8164822 | doi-access = free
 }}.
*{{citation
 |last1        = Giegerich
 |first1       = R.
 |last2        = Kurtz
 |first2       = S.
 |doi          = 10.1007/PL00009177
 |issue        = 3
 |journal      = [[Algorithmica]]
 |pages        = 331–353
 |title        = From Ukkonen to McCreight and Weiner: A Unifying View of Linear-Time Suffix Tree Construction
 |url          = http://europa.zbh.uni-hamburg.de/pubs/pdf/GieKur1997.pdf
 |volume       = 19
 |year         = 1997
 |s2cid = 18039097
 |access-date  = 2012-07-13
 |archive-url  = https://web.archive.org/web/20160303223209/http://europa.zbh.uni-hamburg.de/pubs/pdf/GieKur1997.pdf
 |archive-date = 2016-03-03
 |url-status     = dead
}}.
*{{citation
 | last = Gusfield | first = Dan
 | isbn = 0-521-58519-8
 | publisher = Cambridge University Press
 | title = Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology
 | year = 1997}}.
*{{citation
 | last = Hariharan | first = Ramesh
 | contribution = Optimal Parallel Suffix Tree Construction
 | title = ACM Symposium on Theory of Computing
 | year = 1994|url=https://www.sciencedirect.com/science/article/pii/S0022000097914963/pdf?md5=cf7ddbddc821ab41ef268fb03f6bdbaf&pid=1-s2.0-S0022000097914963-main.pdf}}.
*{{citation
 | last1 = Iliopoulos | first1 = Costas
 | last2 = Rytter | first2 = Wojciech
 | contribution = On Parallel Transformations of Suffix Arrays into Suffix Trees
 | title = 15th Australasian Workshop on Combinatorial Algorithms
 | year = 2004
 | citeseerx = 10.1.1.62.6715
 }}.
*{{citation
 | last1 = Mansour | first1 = Essam
 | last2 = Allam | first2 = Amin
 | last3 = Skiadopoulos | first3 = Spiros
 | last4 = Kalnis | first4 = Panos
 | issue = 1
 | journal =  Proceedings of the VLDB Endowment
 | pages = 49–60
 | title =  ERA: Efficient Serial and Parallel Suffix Tree Construction for Very Long Strings
 | url = http://www.vldb.org/pvldb/vol5/p049_essammansour_vldb2012.pdf
 | volume = 5
 | year = 2011 | doi=10.14778/2047485.2047490| bibcode = 2011arXiv1109.6884M
 | arxiv = 1109.6884
 | s2cid = 7582116
 }}.
*{{citation
 | last = McCreight | first = Edward M. | author-link = Edward M. McCreight
 | doi = 10.1145/321941.321946
 | issue = 2
 | journal = [[Journal of the ACM]]
 | pages = 262–272
 | title = A Space-Economical Suffix Tree Construction Algorithm
 | citeseerx = 10.1.1.130.8022
 | volume = 23
 | date = 1976| s2cid = 9250303 }}.
*{{citation
 | last1 = Phoophakdee | first1 = Benjarath
 | last2 = Zaki | first2 = Mohammed J.
 | contribution = Genome-scale disk-based suffix tree indexing
 | location = New York, NY, USA
 | pages = 833–844
 | publisher = ACM
 | title = SIGMOD '07: Proceedings of the ACM SIGMOD International Conference on Management of Data
 | year = 2007
 | citeseerx = 10.1.1.81.6031
 }}.
*{{citation
 | last1 = Sahinalp | first1 = Cenk
 | last2 = Vishkin | first2 = Uzi
 | contribution = Symmetry breaking for suffix tree construction
 | title = ACM Symposium on Theory of Computing
 | year = 1994
 | pages = 300–309
 | doi = 10.1145/195058.195164
 | s2cid = 5985171
 | doi-access = free
 | isbn = 0-89791-663-8
 }}
*{{citation
 | last = Smyth | first = William
 | publisher = [[Addison-Wesley]]
 | title = Computing Patterns in Strings
 | year = 2003}}.
*{{citation
 | last1 = Shun | first1 = Julian
 | last2 = Blelloch | first2 = Guy E.
 | title = A Simple Parallel Cartesian Tree Algorithm and its Application to Parallel Suffix Tree Construction
 | journal = ACM Transactions on Parallel Computing
 | volume = 1
 | pages = 1–20
 | year = 2014| doi = 10.1145/2661653
 | s2cid = 1912378
 }}.
*{{citation
 | last1 = Tata | first1 = Sandeep
 | last2 = Hankins | first2 = Richard A.
 | last3 = Patel | first3 = Jignesh M.
 | contribution = Practical Suffix Tree Construction
 | pages = 36–47
 | publisher = Morgan Kaufmann
 | title = VLDB '03: Proceedings of the 30th International Conference on Very Large Data Bases
 | year = 2003
 | url = http://www.vldb.org/conf/2004/RS1P3.PDF}}.
*{{citation
 | last = Ukkonen | first = E.
 | doi = 10.1007/BF01206331
 | issue = 3
 | journal = [[Algorithmica]]
 | pages = 249–260
 | title = On-line construction of suffix trees
 | url = http://www.cs.helsinki.fi/u/ukkonen/SuffixT1withFigs.pdf
 | volume = 14
 | year = 1995| s2cid = 6027556
 }}.
*{{citation
 | last = Weiner
 | first = P.
 | contribution = Linear pattern matching algorithms
 | doi = 10.1109/SWAT.1973.13
 | pages = 1–11
 | title = 14th Annual IEEE Symposium on Switching and Automata Theory
 | contribution-url = http://airelles.i3s.unice.fr/files/Weiner.pdf
 | year = 1973
 | title-link = Symposium on Foundations of Computer Science
 | access-date = 2015-04-16
 | archive-date = 2016-03-03
 | archive-url = https://web.archive.org/web/20160303211939/http://airelles.i3s.unice.fr/files/Weiner.pdf
 | url-status = dead
 }}.
*{{citation
 | last1 = Zamir | first1 = Oren
 | last2 = Etzioni | first2 = Oren
 | author-link2=Oren Etzioni
 | contribution = Web document clustering: a feasibility demonstration
 | location = New York, NY, USA
 | pages = 46–54
 | publisher = ACM
 | title = SIGIR '98: Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval
 | year = 1998
 | citeseerx = 10.1.1.36.4719
 }}.