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...

Full description

Saved in:

Bibliographic Details
Published in:	Discrete Applied Mathematics Vol. 353; pp. 44 - 64
Main Authors:	Asahiro, Yuichi, Jansson, Jesper, Lin, Guohui, Miyano, Eiji, Ono, Hirotaka, Utashima, Tadatoshi
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 15.08.2024
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!