Polynomial-time equivalences and refined algorithms for longest common subsequence variants

The problem of computing the longest common subsequence of two sequences (LCS for short) is a classical and fundamental problem in computer science. In this article, we study four variants of LCS: the Repetition-Bounded Longest Common Subsequence problem (RBLCS), the Multiset-Restricted Common Subse...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Discrete Applied Mathematics Ročník 353; s. 44 - 64
Hlavní autori:	Asahiro, Yuichi, Jansson, Jesper, Lin, Guohui, Miyano, Eiji, Ono, Hirotaka, Utashima, Tadatoshi
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 15.08.2024
Predmet:	Approximation algorithm Dynamic programming Exact algorithm Longest common subsequence Multiset-restricted One-side-filled Repetition-bounded Two-side-filled Multiset-restricted Longest common subsequence Two-side-filled Dynamic programming Exact algorithm Approximation algorithm One-side-filled Repetition-bounded
ISSN:	0166-218X, 1872-6771
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!