• Daniel Gusfield
  in Algorithms > String Algorithms with algorithms daniel gusfield suffix trees
• Fast Algorithm for Making Suffix Arrays and for Burrows-Wheeler Transformation
  We propose a fast and memory efficient algorithm for sorting suffixes of a text in lexicographic order. It is important to sort suffixes because an array of indexes of suffixes is called suffix array and it is a memory efficient alternative of the suffix tree. Sorting suffixes is also used for the Burrows-Wheeler transformation in the Block Sorting text compression, therefore fast sorting algorithms are desired. We compare algorithms...
  Scientific Literature Digital Library incorporating autonomous citation indexing, awareness and tracking, citation context, related document retrieval, similar document identification, citation graph analysis, and query-sensitive document summaries. Advantages in terms of availability, coverage, timeliness, and efficiency. Isaac Councill and C. Lee Giles.
  autonomous citation citeseer citeseerx computer digita index indexing literature researchindex science scienceindex scientific
  in Algorithms > String Algorithms with algorithms suffix trees
• SALM: Toolkit of using Suffix Array in Empirical Natural Language Processing
  SALM is C++ package that provides functions to locate and estimates statistics of n-grams in a large corpus.
  in Public bookmarks with arrays computational linguistics n-grams suffix
• Suffix Trees
  in Algorithms > String Algorithms with algorithms suffix trees

suffix from all users