通过邻接和断点的偏序对齐
Partial order alignment by adjacencies and breakpoints
摘要:
线性化两个偏序以最大化邻接数和最小化断点数是APX困难的。即使两个偏序中的一个已经是线性序,另一个是区间序,或者两个偏序都是弱序,这也成立。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。