Dec 22, 2020 · We develop a randomized algorithm that solves Max-Duo PSM in time, and a deterministic algorithm that solves this problem in time.
We say that a mapping m preserves a duo (i, i + 1) if m(i)+1= m(i + 1). Accordingly, the Max-Duo PSM problem is defined as follows. Maximum-Duo Preservation ...
Abstract. In the Maximum-Duo Preservation String Mapping (Max-Duo PSM) problem, the input consists of two related strings A and B of length n and a ...
In the Maximum-Duo Preservation String Mapping (Max-Duo PSM) problem, the input consists of two related strings A and B of length n and a nonnegative integer k.
In the MAXIMUM-DUO PRESERVATION STRING MAPPING (MAX-DUO PSM) problem, the input consists of two related strings A and B of length n and a nonnegative ...
In the MAXIMUM-DUO PRESERVATION STRING MAPPING (MAX-DUO PSM) problem, the input consists of two related strings A and B of length n and a nonnegative ...
In this paper we investigate the parameterized complexity of the Maximum-Duo Preservation String Mapping Problem, the complementary of the Minimum Common ...
Revisiting the Parameterized Complexity of Maximum-Duo ... - dblp
dblp.uni-trier.de › KomusiewiczOZ17
Bibliographic details on Revisiting the Parameterized Complexity of Maximum-Duo Preservation String Mapping.
In the Maximum-Duo Preservation String Mapping (Max-Duo PSM) problem, the input consists of two related strings A and B of length n and a nonnegative ...
In the Maximum-Duo Preservation String Mapping (Max-Duo PSM) problem, the input consists of two related strings A and B of length n and a nonnegative integer k.