The Maximum Duo-Preservation String Mapping Problem with Bounded Alphabet *

DOI10.4230/lipics.wabi.2021.5zbMath1519.92155OpenAlexW3185895333MaRDI QIDQ6133865

Jérôme Monnot, Nicolas Boria, Laurent Gourvès, Vangelis Th. Paschos

Publication date: 24 July 2023

Full work available at URL: https://hal.science/hal-03435225

zbMATH Keywords

polynomial time approximation schememaximum-duo preservation string mappingbounded alphabet

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Protein sequences, DNA sequences (92D20) Approximation algorithms (68W25) Computational methods for problems pertaining to biology (92-08)

This page was built for publication: The Maximum Duo-Preservation String Mapping Problem with Bounded Alphabet *