On Palindromic Sequence Automata and Applications

In this paper, we present a novel weighted finite automata called PSA (Palindromic Subsequence Automata) that is a compact representation of all the palindromic subsequences of a string. Then we use PSA to solve the LCPS (Longest Common Palindromic Subsequence) problem. Our automata based algorithms...

Full description

Saved in:
Bibliographic Details
Published inImplementation and Application of Automata pp. 158 - 168
Main Authors Hasan, Md. Mahbubul, Islam, A. S. M. Sohidull, Rahman, M. Sohel, Sen, Ayon
Format Book Chapter
LanguageEnglish
Published Berlin, Heidelberg Springer Berlin Heidelberg 2013
SeriesLecture Notes in Computer Science
Subjects
Alphabet Size
Edge Cost
Longe Common Subsequence
Space Complexity
Time Complexity
Online AccessGet full text

Cover

More Information
Summary:In this paper, we present a novel weighted finite automata called PSA (Palindromic Subsequence Automata) that is a compact representation of all the palindromic subsequences of a string. Then we use PSA to solve the LCPS (Longest Common Palindromic Subsequence) problem. Our automata based algorithms are efficient both in theory and in practice.
ISBN:9783642392733
3642392733
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-642-39274-0_15