Faster space-efficient STR-IC-LCS computation

One of the most fundamental method for comparing two given strings A and B is the longest common subsequence (LCS), where the task is to find (the length) of an LCS of A and B. In this paper, we deal with the STR-IC-LCS1 problem which is one of the constrained LCS problems proposed by Chen and Chao...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theoretical computer science Jg. 1003; S. 114607
Hauptverfasser:	Yonemoto, Yuki, Nakashima, Yuto, Inenaga, Shunsuke, Bannai, Hideo
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 01.07.2024
Schlagworte:	Constrained longest common subsequence Dynamic programming String algorithms String algorithms Constrained longest common subsequence Dynamic programming
ISSN:	0304-3975, 1879-2294
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!