Doubly-Constrained LCS and Hybrid-Constrained LCS problems revisited |
| |
| Authors: | Effat Farhana M. Sohel Rahman |
| |
| Affiliation: | 1. A?EDA Group, Department of CSE, BUET, Dhaka-1000, Bangladesh;2. Department of CSE, AUST, Dhaka-1208, Bangladesh |
| |
| Abstract: | ![]()
We revisit two recently studied variants of the classic Longest Common Subsequence (LCS) problem, namely, the Doubly-Constrained LCS (DC-LCS) and Hybrid-Constrained LCS (HC-LCS) problems. We present finite automata based algorithms for both problems. |
| |
| Keywords: | Finite automata Longest common subsequence Algorithms Combinatorial problems |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
