Abouelhoda, M., Kurtz, S., Ohlebusch, E.: Replacing suffix trees with enhanced suffix arrays. J. Discret. Algorithms 2, 53–86 (2004)
Article
MathSciNet
MATH
Google Scholar
Aluru, S. (ed.): Handbook of Computational Molecular Biology. Computer and Information Science Series. Chapman and Hall/CRC Press, Boca Raton (2005)
Google Scholar
Amir, A., Kopelowitz, T., Lewenstein, M., Lewenstein, N.: Towards real-time suffix tree construction. In: Proc. String Processing and Information Retrieval Symposium (SPIRE), 2005, pp. 67–78
Google Scholar
Ciriani, V., Ferragina, P., Luccio, F., Muthukrishnan, S.: A data structure for a sequence of string acesses in external memory. ACM Trans. Algorithms 3 (2007)
Google Scholar
Crescenzi, P., Grossi, R., Italiano, G.: Search data structures for skewed strings. In: International Workshop on Experimental and Efficient Algorithms (WEA). Lecture Notes in Computer Science, vol. 2, pp. 81–96. Springer, Berlin (2003)
Google Scholar
Crochemore, M., Rytter, W.: Jewels of Stringology. World Scientific Publishing Company, Singapore (2002)
Book
Google Scholar
Ferragina, P., Grossi, R.: Optimal On-Line Search and Sublinear Time Update in String Matching. SIAM J. Comput. 3, 713–736 (1998)
Article
MathSciNet
Google Scholar
Franceschini, G., Grossi, R.: A general technique for managing strings in comparison‐driven data structures. In: Annual International Colloquium on Automata, Languages and Programming (ICALP), 2004
Google Scholar
Grossi, R., Italiano, G.: Efficient techniques for maintaining multidimensional keys in linked data structures. In: Annual International Colloquium on Automata, Languages and Programming (ICALP), 1999, pp. 372–381
Google Scholar
Gusfield, D.: Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. Cambridge University Press, New York (1997)
Book
MATH
Google Scholar
Karkkainen, J., Sanders, P., Burkhardt, S.: Linear work suffix arrays construction. J. ACM 53, 918–936 (2006)
Article
MathSciNet
Google Scholar
Kasai, T., Lee, G., Arimura, H. et al.: Linear-time longest‐common‐prefix computation in suffix arrays and its applications. In: Proc. 12th Annual Symposium, Combinatorial Pattern Matching (CPM), 2001, pp. 181–192
Google Scholar
Ko, P., Aluru, S.: Space efficient linear time construction of suffix arrays. J. Discret. Algorithms 3, 143–156 (2005)
Article
MathSciNet
MATH
Google Scholar
Ko, P., Aluru, S.: Optimal self‐adjustring tree for dynamic string data in secondary storage. In: Proc. String Processing and Information Retrieval Symposium (SPIRE). Lect. Notes Comp. Sci. vol. 4726, pp. 184–194, Santiago, Chile (2007)
Google Scholar
Manber, U., Myers, G.: Suffix arrays: a new method for on-line search. SIAM J. Comput. 22, 935–948 (1993)
Article
MathSciNet
MATH
Google Scholar
Navarro, G.: A guided tour to approximate string matching. ACM Comput. Surv. 33, 31–88 (2001)
Article
Google Scholar