String process

Higher Edu - Research dev card
Development from the higher education and research community
  • Creation or important update: 12/03/10
  • Minor correction: 12/03/10
Keywords

String process : implementation of algorithms for automatic processing of natural language

This software was developed (or is under development) within the higher education and research community. Its stability can vary (see fields below) and its working state is not guaranteed.
  • Web site
  • System: UNIX-like, Windows, MacOS X
  • Current version: 1.0 - 2001
  • License(s): not yet chosen
  • Status: stable release
  • Support: maintained, no ongoing development
  • Designer(s): Maxime Crochemore, Christophe Hancart, Thierry Lecroq
  • Contact designer(s): Thierry.Lecroq @ univ-rouen.fr
  • Laboratory, service: LIGM, LITIS

 

General software features

Set of C and Java code to implement algorithms on strings :

  • Pattern matching automata
  • String searching with a sliding window
  • Suffix arrays
  • Structures for indexes
  • Indexes
  • Alignments
  • Approximate patterns
  • Local periods

These algorithms are presented in [Crochemore, Hancart, Lecroq, 2001].

Context in which the software is used

This set of programs was provided to explain the algorithms of the book [Crochemore, Hancart, Lecroq, 2001].
This is the first French book dedicated to string process algorithms.

Publications related to the software
  • Algorithmique du texte, M. Crochemore, C. Hancart et T. Lecroq, Vuibert, 2001
  • Algorithms on Strings, M. Crochemore, C. Hancart et T. Lecroq, Cambridge University Press, 2007