Partial order alignment by adjacencies and breakpoints
Computational Complexity
2021-10-07 v1 Discrete Mathematics
Combinatorics
Abstract
Linearizing two partial orders to maximize the number of adjacencies and minimize the number of breakpoints is APX-hard. This holds even if one of the two partial orders is already a linear order and the other is an interval order, or if both partial orders are weak orders.
Cite
@article{arxiv.2110.02809,
title = {Partial order alignment by adjacencies and breakpoints},
author = {Rain Jiang and Kai Jiang and Minghui Jiang},
journal= {arXiv preprint arXiv:2110.02809},
year = {2021}
}