New efficient algorithms for the LCS and constrained LCS problems☆
References (18)
- et al.
A simple algorithm for the constrained sequence problems
Information Processing Letters
(2004) - et al.
A faster algorithm computing string edit distances
Journal of Computer and System Sciences
(1980) The constrained longest common subsequence problem
Information Processing Letters
(2003)- et al.
On economic construction of the transitive closure of a directed graph
Soviet Physics—Doklady
(1975) - et al.
Algorithms for the constrained longest common subsequence problems
- et al.
Algorithms for the constrained longest common subsequence problems
International Journal of Foundations Computer Science
(2005) - et al.
A survey of longest common subsequence algorithms
- et al.
Faster algorithms for computing longest common increasing subsequences
- M. Crochemore, G.M. Landau, M. Ziv-Ukelson, A sub-quadratic sequence alignment algorithm for unrestricted cost...
Cited by (50)
Computing the longest common almost-increasing subsequence
2022, Theoretical Computer ScienceAn efficient algorithm for the longest common palindromic subsequence problem
2022, Theoretical Computer ScienceAn A<sup>⁎</sup> search algorithm for the constrained longest common subsequence problem
2021, Information Processing LettersCitation Excerpt :In a few cases, due to a lack of sufficient details, we had to make our own specific implementation decisions. This was in particular the case for the algorithm of Iliopoulos and Rahman [16]: The bounded heap data structure has to be initialized for different indices, and it remains unclear how this can be done efficiently. The authors were contacted with this issue but we did not receive a response.
A hardness result and new algorithm for the longest common palindromic subsequence problem
2018, Information Processing LettersConstrained sequence analysis algorithms in computational biology
2015, Information SciencesAnalysis of similarity measure in the longitudinal study using improved longest common subsequence method for lung cancer
2015, Biomedical Signal Processing and ControlCitation Excerpt :LCSS was proposed by Wagner and Fisher in the 1970s [11], and widely applied in the field of DNA analysis, pattern identification, text match and automation production [12–14]. The proliferation of LCSS enabled many researchers to focus on improving LCSS: such as, CLCSS—adding constraint to the LCSS [15–20], LAPCS—adding nested arc annotations in RNA structure [10,21], ASM—discussing an approximate string matching problem [22–24] and so on. Nowadays, methods based on LCSS have been widely adopted [12–14].
- ☆
A preliminary version appeared in [C.S. Iliopoulos, M.S. Rahman, New effcient algorithms for LCS and constrained LCS problem, in: H. Broersma, S.S. Dantchev, M. Johnson, S. Szeider (Eds.), Algorithms and Complexity in Durham 2007—Proceedings of the Third ACiD Workshop, 17–19 September 2007, Durham, UK, ACiD, Texts in Algorithmics, vol. 9, King's College, London, ISBN 978-1-904987-55-0, 2007, pp. 83–94.].
- 1
Supported by EPSRC and Royal Society grants.
- 2
Supported by the Commonwealth Scholarship Commission in the UK under the Commonwealth Scholarship and Fellowship Plan (CSFP).
- 3
On Leave from Department of CSE, BUET, Dhaka-1000, Bangladesh.