An efficient method for in memory construction of suffix arrays
Authors:
- H. ItohHIH. Itoh
- H. TanakaHTH. Tanaka
- 20 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 81-88
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- A fast algorithm for making suffix arrays and for Burrows-Wheeler transformation2002
- Algorithms on Strings, Trees and Sequences1997
- Direct construction of compact directed acyclic word graphs1997
- On-line construction of suffix treesAlgorithmica, 1995
- String Searching Algorithms1994
- A new method of N-gram statistics for large number of n and automatic extraction of words and phrases from large text data of Japanese1994
- Suffix Arrays: A New Method for On-Line String SearchesSIAM Journal on Computing, 1993
- The Myriad Virtues of Subword Trees1985
- The smallest automation recognizing the subwords of a textTheoretical Computer Science, 1985
- Rapid identification of repeated patterns in strings, trees and arrays1972