This is a corrigendum for our paper [1], as we have found that the first FPT algorithm for the Maximum-Duo Preservation String Mapping Problem we presented is incorrect. However, we show that, by slightly modifying the color-coding technique on which the algorithm is based, we can fix the error, thus giving a correct FPT algorithm for Maximum-Duo Preservation String Mapping Problem.
Corrigendum to “Parameterized tractability of the maximum-duo preservation string mapping problem” [Theoret. Comput. Sci. 646 (2016) 16–25]
DONDI, Riccardo
2016-01-01
Abstract
This is a corrigendum for our paper [1], as we have found that the first FPT algorithm for the Maximum-Duo Preservation String Mapping Problem we presented is incorrect. However, we show that, by slightly modifying the color-coding technique on which the algorithm is based, we can fix the error, thus giving a correct FPT algorithm for Maximum-Duo Preservation String Mapping Problem.File allegato/i alla scheda:
| File | Dimensione del file | Formato | |
|---|---|---|---|
|
CorrigendumMaxDuo.pdf
accesso aperto
Versione:
Documento in Pre-print
Licenza:
Licenza default Aisberg
Dimensione del file
193.27 kB
Formato
Adobe PDF
|
193.27 kB | Adobe PDF | Visualizza/Apri |
|
Dondi_2016_Corrigendum.pdf
Solo gestori di archivio
Versione:
publisher's version - versione editoriale
Licenza:
Licenza default Aisberg
Dimensione del file
173.06 kB
Formato
Adobe PDF
|
173.06 kB | Adobe PDF | Visualizza/Apri |
Pubblicazioni consigliate
Aisberg ©2008 Servizi bibliotecari, Università degli studi di Bergamo | Terms of use/Condizioni di utilizzo
