C. Sharma and A. ,

K. Vyas, Parallel Approaches in Multiple Sequence Alignments, International Journal of Advanced Research in Computer Science and Software Engineering, vol.4, issue.2, 2014.

W. Masek and M. Paterson, A faster algorithm computing string edit distances, Journal of Computer and System sciences, vol.20, issue.1, pp.90002-90003, 1980.

B. Brubach and J. Ghurye, A Succinct Four Russians Speedup for Edit Distance Computation and One-against-many Banded Alignment, Annual Symposium on Combinatorial Pattern Matching (CPM 2018), pp.1-12, 2018.

A. Apostolico, M. J. Atallah, L. L. Larmore, and S. Macfaddin, Efficient parallel algorithms for string editing and related problems, SIAM Journal on Computing, vol.19, issue.5, pp.968-988, 1990.

C. E. Alves, E. N. Cáceres, F. Dehne, and P. Shor, Parallel Dynamic Programming for Solving the String Editing Problem on a CGM/BSP, Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures, pp.275-281, 2002.

Y. Kim, J. C. Na, H. Park, and J. S. Sim, A space-efficient alphabet-independent Four-Russians' lookup table and a multithreaded Four-Russians' edit distance algorithm, Theoretical Computer Science, vol.656, pp.173-179, 2016.

V. K. Tchendji, Solutions parallèles efficaces sur le modèle CGM d'une classe de problèmes issus de la programmation dynamique, 2014.

E. Chanoni, T. Lecroq, A. Pauchet, and P. Shor, Une nouvelle heuristique pour l'alignement de motifs 2D par programmation dynamique, Journées Francophones de Planification, Décision et Apprentissage pour la conduite de systèmess, pp.83-92, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00452916

V. Arlazarov, Y. Dinitz, M. Kronrod, and I. Faradzhev, On economical construction of the transitive closure of an oriented graph, Doklady Akademii Nauk, vol.194, issue.3, pp.487-488, 1970.

M. Crochemore, G. Landau, and M. Ziv-ukelson, A subquadratic sequence alignment algorithm for unrestricted scoring matrices, SIAM journal on computing, vol.32, issue.6, pp.1654-1673, 2003.
URL : https://hal.archives-ouvertes.fr/hal-00619573

A. Backurs and P. Indyk, Edit distance cannot be computed in strongly subquadratic time (unless SETH is false), Proceedings of the forty-seventh annual ACM symposium on Theory of computing, pp.51-58, 2015.

J. P. Schmidt, All shortest paths in weighted grid graphs and its application to finding all approximate repeats in strings, Proceedings Third Israel Symposium on the Theory of Computing and Systems, pp.67-77, 1995.

A. Aggarwal, M. Klawe, S. Moran, P. Shor, and R. Wilber, Geometric applications of a matrix-searching algorithm, Algorithmica, vol.2, issue.1-4, pp.195-208, 1987.