Polynomial-time equivalences and refined algorithms for longest common subsequence variants.
Saved in:
| Title: | Polynomial-time equivalences and refined algorithms for longest common subsequence variants. |
|---|---|
| Authors: | Asahiro, Yuichi1, asahiro@is.kyusan-u.ac.jp, Jansson, Jesper2, jj@i.kyoto-u.ac.jp, Lin, Guohui3, guohui@ualberta.ca, Miyano, Eiji1,4, miyano@ai.kyutech.ac.jp, Ono, Hirotaka5, ono@nagoya-u.jp, Utashima, Tadatoshi4, utashima.tadatoshi965@mail.kyutech.jp |
| Source: | Discrete Applied Mathematics; Aug2024, Vol. 353, p44-64, 21p |
| Database: | Applied Science & Technology Source |
| ISSN: | 0166218X |
|---|---|
| DOI: | 10.1016/j.dam.2024.04.006 |
