Name: find_index_approx
Author: Johannes Krugel <krugel@in.tum.de>
Author: Henrik Poppe <poppeh@in.tum.de>
Maintainer: Johannes Krugel <krugel@in.tum.de>
License: BSD 3-clause
Copyright: 2011, Technische Universitaet Muenchen
Status: under development
Homepage: http://www14.in.tum.de/papi/
Description: Index-based approximate search algorithms.
 Algorithms to find the occurences of a search pattern in a text allowing
 some errors and using an index structure. The algorithms implemented in
 this module are the classical dynamic programming algorithm performing a
 backtracking a in a suffix tree, and two variants of partitioning algorithms.
 .
 [NBYST2001] G. Navarro and R.A. Baeza-Yates and E. Sutinen and J. Tarhio
   "Indexing Methods for Approximate String Matching",
   IEEE Data Engineering Bulletin, 2001, 24, pp. 19-27,
   http://sites.computer.org/debull/A01DEC-CD.pdf
 .
 See also:
 [Poppe2010] H. Poppe "Approximative Suche in Textindizes",
   Bachelor thesis, Technische Universitt Mnchen, 2010
