Palindromic Subsequence Automata and Longest Common Palindromic Subsequence

Palindromic Subsequence Automata and Longest Common Palindromic Subsequence

In this paper, we present a novel weighted finite automaton called palindromic subsequence automaton (PSA) that is a compact representation of all the palindromic subsequences of a string. Then we use PSA to solve the longest common palindromic subsequence problem. Our automata based algorithms are...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Mathematics in computer science 2017-06, Vol.11 (2), p.219-232
Hauptverfasser: Hasan, Md. Mahbubul, Islam, A. S. M. Sohidull, Rahman, M. Sohel, Sen, Ayon
Format: Artikel
Sprache:eng
Schlagworte:
Computer Science
Mathematics
Mathematics and Statistics
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper, we present a novel weighted finite automaton called palindromic subsequence automaton (PSA) that is a compact representation of all the palindromic subsequences of a string. Then we use PSA to solve the longest common palindromic subsequence problem. Our automata based algorithms are efficient both in theory and in practice.
ISSN:1661-8270
1661-8289
DOI:10.1007/s11786-016-0288-7