Replacing suffix trees with enhanced suffix arraysMohamed Abouelhoda(Universität Ulm), Stefan Kurtz(Universität Hamburg), Enno Ohlebusch(Universität Ulm)Journal of Discrete AlgorithmsFebruary 28, 200410.1016/s1570-8667(03)00065-0Cited by 666SaveCiteExport RISWatch citationsAbstractRelated PapersAlgorithms on strings, trees, and sequences computer science and computational biologyDan Gusfield|Unknown|1997|3.5kAlgorithms on Strings, Trees and SequencesDan Gusfield|Cambridge University Press eBooks|1997|3.1kLinear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its ApplicationsToru Kasai, Gun-Ho Lee, Hiroki Arimura et al.|Lecture notes in computer science|2001|468Fast algorithms for sorting and searching stringsJon Bentley, Robert Sedgewick|Unknown|1997|399Reducing the space requirement of suffix treesStefan Kurtz|Software Practice and Experience|1999|335