Abstract
We examine some of the classic problems related to suffix trees from 70's and show some recent results on sorting suffixes with small space and suffix selection. Further, we introduce modern versions of suffix sorting and their application to XML processing. The study of combinatorial aspects of strings continues to flourish, and we present several open problems with modern applications. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Muthukrishnan, S. (2007). Stringology: Some classic and some modern problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4580 LNCS, p. 2). Springer Verlag. https://doi.org/10.1007/978-3-540-73437-6_2
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
