Article citationsMore>>

J. W. Hunt and T. G. Szymanski, “A Fast Algorithm for Computing Longest Common Subsequences,” Communications of the ACM, Vol. 20, No. 5, 1977, pp. 350-353. http:dx.doi.org/10.1145/359581.
359603

has been cited by the following article:

• TITLE: On the Metaheuristics Approach to the Problem of Genetic Sequence Comparison and Its Parallel Implementation

  AUTHORS: Sergey Makarkin, Boris Melnikov, Alexander Panin

  KEYWORDS: Metaheuristic Approach; Genetic Sequence Analysis; Levenshtein Distance; Strings Alignment; Parallel Programming

  JOURNAL NAME: Applied Mathematics, Vol.4 No.10A, September 30, 2013

  ABSTRACT: We describe parallel implementation of the metaheuristic approach to the problem of comparing strings representing DNA sequence. By this approach, one can define a whole new class of metrics on a set of strings; some of this metrics can lead to interesting results when used for string comparison. We propose several heuristics; compare results achieved when using those heuristics and compare parallel and sequential implementation of proposed approach.