1 citations · 1 across the 4 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2023
Men Can't Always be Transformed into Mice: Decision Algorithms and Complexity for Sorting by Symmetric Reversals
Xin Tong, Yixiao Yu, Ziyi Fang +4
Sorting a permutation by reversals is a famous problem in genome rearrangements. Since 1997, quite some biological evidence were found that in many genomes the reversed regions are…
cs.DS2014★ 1 cited
A 4/3-approximation algorithm for finding a spanning tree to maximize its internal vertices
Xingfu Li, Daming Zhu
This paper focuses on finding a spanning tree of a graph to maximize the number of its internal vertices. We present an approximation algorithm for this problem which can achieve a…