R. A. Baeza-yates and G. Navarro, A faster algorithm for approximate string matching, CPM, pp.1-23, 1996.
DOI : 10.1007/3-540-61258-0_1

A. A. Bertossi, F. Luccio, L. Pagli, and E. Lodi, A Parallel Solution to the Approximate String Matching Problem, The Computer Journal, vol.35, issue.5, pp.524-526, 1992.
DOI : 10.1093/comjnl/35.5.524

M. Crochemore, C. S. Iliopoulos, and Y. Pinzon, Speeding-up hirschberg and hunt-szymanski LCS algorithms, Proceedings Eighth Symposium on String Processing and Information Retrieval, pp.89-103, 2002.
DOI : 10.1109/SPIRE.2001.989737
URL : https://hal.archives-ouvertes.fr/hal-00619568

A. R. Galper and D. R. Brutlag, Parallel similarity search and alignment with the dynamic programming method, p.14, 1990.

N. Hall, Advanced sequencing technologies and their wider impact in microbiology, Journal of Experimental Biology, vol.210, issue.9, pp.1518-1525, 2007.
DOI : 10.1242/jeb.001370

X. Huang, A space-efficient parallel sequence comparison algorithm for a message-passing multiprocessor, International Journal of Parallel Programming, vol.18, issue.6, pp.223-239, 1990.
DOI : 10.1007/BF01407900

C. S. Iliopoulos, L. Mouchard, and Y. J. Pinzon, The Max-Shift Algorithm for Approximate String Matching, WAE '01: Proceedings of the 5th International Workshop on Algorithm Engineering, pp.13-25, 2001.
DOI : 10.1007/3-540-44688-5_2
URL : https://hal.archives-ouvertes.fr/hal-00465087

G. Landau, G. Myers, J. P. Schmidt, and P. Schmidt, Incremental String Comparison, SIAM Journal on Computing, vol.27, issue.2, pp.557-582, 1995.
DOI : 10.1137/S0097539794264810
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.38.1766

G. M. Landau and U. Vishkin, Fast string matching with k differences, Journal of Computer and System Sciences, vol.37, issue.1, pp.63-78, 1988.
DOI : 10.1016/0022-0000(88)90045-1

G. M. Landau and U. Vishkin, Fast parallel and serial approximate string matching, Journal of Algorithms, vol.10, issue.2, pp.157-169, 1989.
DOI : 10.1016/0196-6774(89)90010-2

E. H. Margulies and E. Birney, Approaches to comparative sequence analysis: towards a functional view of vertebrate genomes, Nature Reviews Genetics, vol.35, issue.4, pp.303-313, 2008.
DOI : 10.1038/nrg2185

E. W. Myers, A fast bit-vector algorithm for approximate string matching based on dynamic programming, Journal of the ACM, vol.46, issue.3, pp.395-415, 1999.
DOI : 10.1145/316542.316550

C. C. Dos-reis, Approximate string-matching algorithm using parallel methods for molecular sequence comparisons, Artificial intelligence, 2005. epia 2005. portuguese conference on, pp.140-143, 2005.

S. C. Schuster, Next-generation sequencing transforms today's biology, Nature Methods, vol.39, issue.1, pp.16-18, 2007.
DOI : 10.1038/nmeth1156

P. H. Seller, The theory and computation of evolutionary distances: Pattern recognition, Journal of Algorithms, vol.1, issue.4, pp.359-373, 1980.
DOI : 10.1016/0196-6774(80)90016-4

E. Ukkonen, Finding approximate patterns in strings, Journal of Algorithms, vol.6, issue.1, pp.132-137, 1985.
DOI : 10.1016/0196-6774(85)90023-9

B. Wold and R. Myers, Sequence census methods for functional genomics, Nature Methods, vol.127, issue.1, pp.19-21, 2007.
DOI : 10.1038/nmeth1157

S. Wu and U. Manber, Fast text searching: allowing errors, Communications of the ACM, vol.35, issue.10, pp.83-91, 1992.
DOI : 10.1145/135239.135244

S. Wu, U. Manber, and G. Myers, A subquadratic algorithm for approximate limited expression matching, Algorithmica, vol.35, issue.2, pp.50-67, 1996.
DOI : 10.1007/BF01942606