TY - JOUR AU - Levenstein, V. PY - 1965 DA - 1965// TI - Binary codes capable of correcting spurious insertions and deletions of ones JO - Probl Inf Transmission VL - 1 ID - Levenstein1965 ER - TY - JOUR AU - Vintsyuk, T. PY - 1968 DA - 1968// TI - Speech discrimination by dynamic programming JO - Cybernetics VL - 4 UR - https://doi.org/10.1007/BF01074755 DO - 10.1007/BF01074755 ID - Vintsyuk1968 ER - TY - JOUR AU - Needleman, S. AU - Wunsch, C. PY - 1970 DA - 1970// TI - A general method applicable to the search for similarities in the amino acid sequences of two proteins JO - J Mol Biol VL - 48 UR - https://doi.org/10.1016/0022-2836(70)90057-4 DO - 10.1016/0022-2836(70)90057-4 ID - Needleman1970 ER - TY - JOUR AU - Sankoff, D. PY - 1972 DA - 1972// TI - Matching sequences under deletion/insertion constraints JO - Proceedings of the National Academy of Sciences of the USA VL - 69 UR - https://doi.org/10.1073/pnas.69.1.4 DO - 10.1073/pnas.69.1.4 ID - Sankoff1972 ER - TY - JOUR AU - Sellers, P. PY - 1974 DA - 1974// TI - On the theory and computation of evolutionary distances JO - SIAM J Appl Math VL - 26 UR - https://doi.org/10.1137/0126070 DO - 10.1137/0126070 ID - Sellers1974 ER - TY - JOUR AU - Wagner, R. AU - Fisher, M. PY - 1974 DA - 1974// TI - The string to string correction problem JO - J ACM VL - 21 UR - https://doi.org/10.1145/321796.321811 DO - 10.1145/321796.321811 ID - Wagner1974 ER - TY - JOUR AU - Lowrance, D. AU - Wagner, R. PY - 1975 DA - 1975// TI - An extension of the string-to-string correction problem JO - J ACM VL - 22 UR - https://doi.org/10.1145/321879.321880 DO - 10.1145/321879.321880 ID - Lowrance1975 ER - TY - JOUR AU - Masek, W. AU - Paterson, M. PY - 1980 DA - 1980// TI - A faster algorithm for computing string edit distances JO - J Comput Syst VL - 20 UR - https://doi.org/10.1016/0022-0000(80)90002-1 DO - 10.1016/0022-0000(80)90002-1 ID - Masek1980 ER - TY - JOUR AU - Arlazarov, V. L. AU - Dinic, E. A. AU - A, K. M. AU - Faradzev, I. A. PY - 1970 DA - 1970// TI - On economic construction of the transitive closure of a directed graph JO - Soviet Math VL - 11 ID - Arlazarov1970 ER - TY - JOUR AU - Hirschberg, D. S. PY - 1975 DA - 1975// TI - A Linear Space Algorithm for Computing Maximal Common Subsequences JO - Communications of the ACM VL - 18 UR - https://doi.org/10.1145/360825.360861 DO - 10.1145/360825.360861 ID - Hirschberg1975 ER - TY - JOUR AU - Ukkonen, E. PY - 1985 DA - 1985// TI - Algorithms for approximate string matching JO - Information and Control VL - 64 UR - https://doi.org/10.1016/S0019-9958(85)80046-2 DO - 10.1016/S0019-9958(85)80046-2 ID - Ukkonen1985 ER - TY - JOUR AU - Myers, E. W. PY - 1986 DA - 1986// TI - An O(ND) difference algorithm and its variations JO - Algorithmica VL - 1 UR - https://doi.org/10.1007/BF01840446 DO - 10.1007/BF01840446 ID - Myers1986 ER - TY - CHAP AU - Powell, D. R. PY - 2001 DA - 2001// TI - Algorithms for Sequence Alignment BT - PhD thesis PB - Monash University CY - School of Computer Science and Software Engineering ID - Powell2001 ER - TY - STD TI - Ribosomal Database Project (RDP)[http://rdp.cme.msu.edu] UR - http://rdp.cme.msu.edu ID - ref14 ER - TY - STD TI - Edit distance algorithm implementations[http://www.cs.miami.edu/~dimitris/edit_distance] UR - http://www.cs.miami.edu/~dimitris/edit_distance ID - ref15 ER -