• Corpus ID: 238408087

Partial order alignment by adjacencies and breakpoints

@article{Jiang2021PartialOA,
  title={Partial order alignment by adjacencies and breakpoints},
  author={Rain Jiang and Kai Jiang and Minghui Jiang},
  journal={ArXiv},
  year={2021},
  volume={abs/2110.02809}
}
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. 
1 Citations

Figures from this paper

Efficient multivariate low-degree tests via interactive oracle proofs of proximity for polynomial codes
TLDR
The first interactive oracle proofs of proximity (IOPP) for tensor products of Reed-Solomon codes and for Reed-Muller codes (evaluation of polynomials with bounds on individual degrees) are presented.

References

SHOWING 1-10 OF 11 REFERENCES
Revisiting the Minimum Breakpoint Linearization Problem
TLDR
This paper exposes a flaw in two algorithms formerly known for the Minimum Breakpoint Linearization Problem, and uses it to design three approximation algorithms, with ratios resp O(log(k)loglog( k)), O( log2(|X|)) and m2+4m−4.
Gene Maps Linearization Using Genomic Rearrangement Distances
TLDR
This work first proves NP-completeness complexity results considering the breakpoint and the common interval distances, and gives a dynamic programming algorithm whose running time is exponential for general partial orders, but polynomial when the partial order is derived from a bounded number of genetic maps.
On Some Tighter Inapproximability Results
We give a number of improved inapproximability results, including the best up to date explicit approximation thresholds for bounded occurrence satisfiability problems like MAX-2SAT and E2-LIN-2, and
A short proof that 'proper = unit'
Optimization, Approximation, and Complexity Classes
TLDR
It follows that such a complete problem has a polynomial-time approximation scheme iff the whole class does, and that a number of common optimization problems are complete for MAX SNP under a kind of careful transformation that preserves approximability.
Semiorders and a Theory of Utility Discrimination
In the theory of preferences underlying utility theory i t is generally assumed that the indifference relation is transitive, and this leads t o equivalence classes of indifferent elements or,
Improved Approximation Lower Bounds on Small Occurrence Optimization
...
...