2000 character limit reached
Partial order alignment by adjacencies and breakpoints (2110.02809v1)
Published 6 Oct 2021 in cs.CC, cs.DM, and math.CO
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.