Zobrazit v EDS

Maximum Letter-Duplicated Subsequence (short paper)

Uloženo v:

Podrobná bibliografie
Název:	Maximum Letter-Duplicated Subsequence (short paper)
Autoři:	Dondi, Riccardo, Hosseinzadeh, Mehdi, Popa, Alexandru
Informace o vydavateli:	CEUR-WS, 2024.
Rok vydání:	2024
Témata:	APX-hardness, LCS, String Algorithms
Popis:	In this contribution we consider Max-LL-DUP, an optimization problem that asks for a letter-duplicated subsequence of an input string that contains the maximum number of letters of the alphabet over which the input string is defined. When each letter has at most four occurrences in the input string, we prove that the problem is APX-hard. Then, we give a linear-time algorithm when each letter has at most three occurrences in the input string.
Druh dokumentu:	Conference object
Popis souboru:	application/pdf
Jazyk:	English
Přístupová URL adresa:	https://hdl.handle.net/10446/296087
Rights:	CC BY
Přístupové číslo:	edsair.od......1581..c233e650177bd32ecf069b07e9d3e8ef
Databáze:	OpenAIRE

Popis
Abstrakt:	In this contribution we consider Max-LL-DUP, an optimization problem that asks for a letter-duplicated subsequence of an input string that contains the maximum number of letters of the alphabet over which the input string is defined. When each letter has at most four occurrences in the input string, we prove that the problem is APX-hard. Then, we give a linear-time algorithm when each letter has at most three occurrences in the input string.