An efficient method for in memory construction of suffix arrays

This publication has 10 references indexed in Scilit:

• A fast algorithm for making suffix arrays and for Burrows-Wheeler transformation
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• Algorithms on Strings, Trees and Sequences
  Published by Cambridge University Press (CUP) ,1997
• Direct construction of compact directed acyclic word graphs
  Published by Springer Nature ,1997
• On-line construction of suffix trees
  Algorithmica, 1995
• String Searching Algorithms
  Parallel Algorithms, 1994
• A new method of N-gram statistics for large number of n and automatic extraction of words and phrases from large text data of Japanese
  Published by Association for Computational Linguistics (ACL) ,1994
• Suffix Arrays: A New Method for On-Line String Searches
  SIAM Journal on Computing, 1993
• The Myriad Virtues of Subword Trees
  Published by Springer Nature ,1985
• The smallest automation recognizing the subwords of a text
  Theoretical Computer Science, 1985
• Rapid identification of repeated patterns in strings, trees and arrays
  Published by Association for Computing Machinery (ACM) ,1972