Block Sorting is Hard-Reference-Cited by-同舟云学术

Block Sorting is Hard

Published:2003-06 Issue:03 Volume:14 Page:425-437
ISSN:0129-0541
Container-title:International Journal of Foundations of Computer Science
language:en
Short-container-title:Int. J. Found. Comput. Sci.

Author:

Bein Wolfgang W.¹,Larmore Lawrence L.¹,Latifi Shahram²,Sudborough I. Hal³

Affiliation:

1. Department of Computer Science, University of Nevada, Las Vegas, NV 89154, USA

2. Department of Electrical and Computer Engineering, University of Nevada, Las Vegas, NV 89154, USA

3. Department of Computer Science, Unversity of Texas at Dallas, Richardson, TX 75083, USA

Abstract

Block sorting is used in connection with Optical Character Recognition (OCR). Recent work has focused on finding good strategies which work in practice. In this paper, we show that optimizing block sorting is [Formula: see text]-hard. Along with this result, we give new non-trivial lower bounds. These bound can be computed efficiently. We define the concept of "Local Property Algorithms" and show that several previously published block sorting algorithms fall into this class.

Publisher

World Scientific Pub Co Pte Lt

Subject

Computer Science (miscellaneous)

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0129054103001820

Reference8 articles.

1. Sorting by Transpositions

2. Genome Rearrangements and Sorting by Reversals

3. Bounds for sorting by prefix reversal

4. Sorting by bounded block-moves

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Implementing algorithms for sorting by strip swaps;Proceedings of the 13th ACM International Conference on Bioinformatics, Computational Biology and Health Informatics;2022-08-07

2. New approximations for block sorting;Network Modeling Analysis in Health Informatics and Bioinformatics;2016-02-09

3. Block Sorting Is APX-Hard;Lecture Notes in Computer Science;2015

4. Advanced Techniques for Dynamic Programming;Handbook of Combinatorial Optimization;2013

5. Bounding prefix transposition distance for strings and permutations;Theoretical Computer Science;2012-03