An algorithm for the multiple patterns approximate string matching problem

[1]  Maxime Crochemore,et al.  Algorithms on strings , 2007 .

[2]  Daniel Sunday,et al.  A very fast substring search algorithm , 1990, CACM.

[3]  Gonzalo Navarro,et al.  Average-Optimal Multiple Approximate String Matching , 2003, CPM.

[4]  Heikki Hyyrö.  Bit-parallel approximate string matching algorithms with transposition , 2005, J. Discrete Algorithms.

[5]  Esko Ukkonen,et al.  Approximate Boyer-Moore String Matching , 1993, SIAM J. Comput..

[6]  Udi Manber,et al.  Fast text searching: allowing errors , 1992, CACM.

[7]  Wojciech Rytter,et al.  Text Algorithms , 1994 .

[8]  Wing-Kai Hon,et al.  Approximate string matching using compressed suffix arrays , 2006, Theor. Comput. Sci..

[9]  J. Mullikin,et al.  SSAHA: a fast search method for large DNA databases. , 2001, Genome research.

[10]  S. B. Needleman,et al.  A general method applicable to the search for similarities in the amino acid sequence of two proteins. , 1970, Journal of molecular biology.

[11]  Ricardo A. Baeza-Yates,et al.  Very Fast and Simple Approximate String Matching , 1999, Inf. Process. Lett..

[12]  Robert J. Moore,et al.  A microRNA catalog of the developing chicken embryo identified by a deep sequencing approach. , 2008, Genome research.

[13]  Ruiqiang Li,et al.  SOAP: short oligonucleotide alignment program , 2008, Bioinform..

[14]  Borivoj Melichar,et al.  Approximate string matching using factor automata , 2000, Theor. Comput. Sci..

[15]  Gad M. Landau,et al.  Fast Parallel and Serial Approximate String Matching , 1989, J. Algorithms.