1 citations · 1 across the 6 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2011
On Approximability of Block Sorting
N. S. Narayanaswamy, Swapnoneel Roy
Block Sorting is a well studied problem, motivated by its applications in Optical Character Recognition (OCR), and Computational Biology. Block Sorting has been shown to be NP-Hard…
cs.CC2011
On Sorting by Bounded Block Interchanges
Swapnoneel Roy
In this work, we consider a restricted case of the well studied Sorting by Block Interchanges problem. We put an upper bound k on the length of the blocks (substrings) to be interc…