Finite automata based algorithms on subsequences and supersequences of degenerate strings

Authors:
Costas Iliopoulos;M. Sohel Rahman;Michal Voráček;Ladislav Vagner
Affiliations:
Algorithm Design Group, Department of Computer Science, King's College London, Strand, London WC2R 2LS, United Kingdom;Algorithm Design Group, Department of Computer Science, King's College London, Strand, London WC2R 2LS, United Kingdom;Department of Computer Science & Engineering, Czech Technical University, Czech Republic;Department of Computer Science & Engineering, Czech Technical University, Czech Republic
Venue:
Journal of Discrete Algorithms
Year:
2010

Citing 13
Cited 2

Searching subsequences

Theoretical Computer Science
On the Approximation of Shortest Common Supersequencesand Longest Common Subsequences

SIAM Journal on Computing
Algorithms on strings, trees, and sequences: computer science and computational biology

Algorithms on strings, trees, and sequences: computer science and computational biology
The String-to-String Correction Problem

Journal of the ACM (JACM)
An Extension of the String-to-String Correction Problem

Journal of the ACM (JACM)
The Complexity of Some Problems on Subsequences and Supersequences

Journal of the ACM (JACM)
Linear Algorithm for Data Compression via String Matching

Journal of the ACM (JACM)
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
A Survey of Longest Common Subsequence Algorithms

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

Information Processing Letters
A simple algorithm for the constrained sequence problems

Information Processing Letters
New efficient algorithms for the LCS and constrained LCS problems

Information Processing Letters
Introduction to Algorithms, Third Edition

Introduction to Algorithms, Third Edition

Doubly-Constrained LCS and Hybrid-Constrained LCS problems revisited

Information Processing Letters
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.00

Visualization

Abstract

In this paper, we present linear-time algorithms for the construction two novel types of finite automata and show how they can be used to efficiently solve the Longest Common Subsequence (LCS), Shortest Common Supersequence (SCS) and Constrained Longest Common Subsequence (CLCS) problems for degenerate strings.