Partial order alignment by adjacencies and breakpoints

10/06/2021
by   Rain Jiang, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/21/2020

Betweenness of partial orders

We construct a monadic second-order sentence that characterizes the tern...
research
07/18/2019

Linear-semiorders and their incomparability graphs

A linear-interval order is the intersection of a linear order and an int...
research
03/25/2014

Non-characterizability of belief revision: an application of finite model theory

A formal framework is given for the characterizability of a class of bel...
research
07/30/2021

Interleaving Reconfigurable Interaction: Separating Choice from Scheduling using Glue

Reconfigurable interaction induces another dimension of nondeterminism i...
research
07/17/2018

Expressing Linear Orders Requires Exponential-Size DNNFs

We show that any DNNF circuit that expresses the set of linear orders ov...
research
09/27/2018

Operations on Partial Orders

We define analogues of Boolean operations on not necessarily complete pa...
research
07/27/2014

Defining Relative Likelihood in Partially-Ordered Preferential Structures

Starting with a likelihood or preference order on worlds, we extend it t...

Please sign up or login with your details

Forgot password? Click here to reset