In EDS ansehen

Maximum Letter-Duplicated Subsequence (short paper)

Gespeichert in:

Bibliographische Detailangaben
Titel:	Maximum Letter-Duplicated Subsequence (short paper)
Autoren:	Dondi, Riccardo, Hosseinzadeh, Mehdi, Popa, Alexandru
Verlagsinformationen:	CEUR-WS, 2024.
Publikationsjahr:	2024
Schlagwörter:	APX-hardness, LCS, String Algorithms
Beschreibung:	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.
Publikationsart:	Conference object
Dateibeschreibung:	application/pdf
Sprache:	English
Zugangs-URL:	https://hdl.handle.net/10446/296087
Rights:	CC BY
Dokumentencode:	edsair.od......1581..c233e650177bd32ecf069b07e9d3e8ef
Datenbank:	OpenAIRE

Beschreibung
Abstract:	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.