Abstract
We describe an efficient implementation of a text mining algorithm for discovering a class of simple string patterns. With an index structure, called the virtual suffix tree, for pattern discovery built on the top of the suffix array, the resulting algorithm is simple and fast in practice compared with the previous implementation with the suffix tree.
Cite
CITATION STYLE
Arimura, H., Asaka, H., Sakamoto, H., & Arikawa, S. (2001). Efficient discovery of proximity patterns with suffix arrays. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2089, pp. 152–156). Springer Verlag. https://doi.org/10.1007/3-540-48194-x_14
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
