## Applying Genetic Programming with Similar Bug Fix Information to Automatic Fault Repair

- Geunseok Yang, Youngjun Jeong, Kyeongsic Min, Jung-Won Lee, Byungjeong Lee
- Symmetry
- 2018

Highly Influenced

@article{Nakatsu1982ALC, title={A longest common subsequence algorithm suitable for similar text strings}, author={Narao Nakatsu and Yahiko Kambayashi and Shuzo Yajima}, journal={Acta Informatica}, year={1982}, volume={18}, pages={171-179} }

- Published 1982 in Acta Informatica
DOI:10.1007/BF00264437

Efficient algorithms for computing the longest common subsequence (LCS for short) are discussed. O(pn) algorithm and O(p(m-p) log n) algorithm [Hirschberg 1977] seem to be best among previously known algorithms, where p is the length of an LCS and m and n are the lengths of given two strings (m≦n). There are many applications where the expected length of an LCS is close to m. In this paper, O(n(m-p)) algorithm is presented. When p is close to m (in other words, two given strings are similar… CONTINUE READING