• AGREP
  
  AGREP 3.37 (OS/2, DOS, Win3.x and Win95/NT). Powerful tool for fast approximate fuzzy text searching files for strings, regular expressions. User-definable records.
  with agrep algorithms
• Daniel Gusfield
  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...
  CiteSeerX - Document Details (Isaac Councill, Lee Giles): 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 transforma
  citeseerx kunihiko sadakane
  with algorithms suffix trees
• fuzzy matching transliteration
  Google Scholar links to papers on fuzzy matching in transliteration.
  with matching regexp string
• Levenshtein Distance
  with algorithms distance levenshtein
• levenshtein transliteration
  Google Scholar links to papers on Levenshtein transliteration
  with levenshtein matching string transliteration
• Pattern Matching Pointers
  with algorithms matching pattern pointers
• Pattern Matching Pointers maintained by Stefano Lonardi
  Pointers to literature, implementations etc. of a wide variety of string matching algorithms.
  with algorithms string by 2 users
• Suffix Trees
  with algorithms suffix trees
• Text Searching and Processing
  This is a part of the course "Text Searching and Processing" of the Master in Advanced Computing delivered by the Department of Computer Science of King's College London. It contains lectures on string searching algorithms and on text indexing methods.
  with algorithms string text
• TRE approx regex
  Approximate regex matching, with source code
  agrep approximate expression expressions fuzzy grep library libtre matcher matching pattern regex regexp regular tre
  with distance levenshtein matching regexp string
• XPARAL
  Parametric Sequence Alignment
  with algorithms alignment parametric sequence

Bookmarks 1 - 12