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

Celý popis

Podrobná bibliografia

Vydané v:	Theoretical computer science Ročník 1003; s. 114607
Hlavní autori:	Yonemoto, Yuki, Nakashima, Yuto, Inenaga, Shunsuke, Bannai, Hideo
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 01.07.2024
Predmet:	Constrained longest common subsequence Dynamic programming String algorithms String algorithms Constrained longest common subsequence Dynamic programming
ISSN:	0304-3975, 1879-2294
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!