Revisiting the parameterized complexity of maximum-duo preservation string mapping (Q2210511)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Revisiting the parameterized complexity of maximum-duo preservation string mapping
scientific article

    Statements

    Revisiting the parameterized complexity of maximum-duo preservation string mapping (English)
    0 references
    6 November 2020
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    maximum-duo preservation string mapping
    0 references
    parameterized algorithms
    0 references
    kernelization
    0 references
    0 references