Doubly-Constrained LCS and Hybrid-Constrained LCS problems revisited

Authors:
Effat Farhana;M. Sohel Rahman
Affiliations:
AEDA Group, Department of CSE, BUET, Dhaka-1000, Bangladesh and Department of CSE, AUST, Dhaka-1208, Bangladesh;AEDA Group, Department of CSE, BUET, Dhaka-1000, Bangladesh
Venue:
Information Processing Letters
Year:
2012

Citing 11
Cited 1

The String-to-String Correction Problem

Journal of the ACM (JACM)
Introduction to automata theory, languages, and computation, 2nd edition

ACM SIGACT News
Online Construction of Subsequence Automata for Multiple Texts

SPIRE '00 Proceedings of the Seventh International Symposium on String Processing Information Retrieval (SPIRE'00)
The constrained longest common subsequence problem

Information Processing Letters
Exemplar Longest Common Subsequence

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
New efficient algorithms for the LCS and constrained LCS problems

Information Processing Letters
Finite automata based algorithms on subsequences and supersequences of degenerate strings

Journal of Discrete Algorithms
Repetition-free longest common subsequence

Discrete Applied Mathematics
Variants of constrained longest common subsequence

Information Processing Letters
Finite automata based algorithms for the generalized constrained longest common subsequence problems

SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
On the generalized constrained longest common subsequence problems

Journal of Combinatorial Optimization

On palindromic sequence automata and applications

CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata

Quantified Score

Hi-index	0.89

Visualization

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.