Block sorting is hard

Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN

Volumn 2002-January, Issue , 2002, Pages 349-354

  Bein, W W ^a   Larmore, L L ^a   Latifi, S ^a   Sudborough, I H ^b  

^a University of Nevada Las Vegas   (United States)

^b The University of Texas at Dallas   (United States)

Author keywords

Approximation algorithms; Character recognition; Computer science; Optical character recognition software; Parallel architectures; Performance evaluation; Sorting; Testing

Indexed keywords

ALGORITHMS; APPROXIMATION ALGORITHMS; CHARACTER RECOGNITION; COMPUTER SCIENCE; OPTICAL CHARACTER RECOGNITION; PARALLEL ARCHITECTURES; SOFTWARE TESTING; SORTING; TESTING;

BLOCK-SORTING; LOCAL PROPERTY; LOWER BOUNDS; NON-TRIVIAL; NP-HARD; OPTICAL CHARACTER RECOGNITION (OCR); OPTICAL CHARACTER RECOGNITION SOFTWARE; PERFORMANCE EVALUATION;

NETWORK ARCHITECTURE;

EID: 84948447829     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISPAN.2002.1004305     Document Type: Conference Paper

References (11)

1. V. Bafna and P.A. Pevzner. Sorting by transposition. SIAM Journal on Discrete Mathematics, 11:224-240, 1998.
2. V. Bafna and P.A. Pevzner. Genome rearrangements and sorting by reversals. SIAM Journal on Computing, 25:272-289, 1999.
3. A. Caprara. Sorting by reversals is difficult. In Proceedings 1st Conference on Computational Molecular Biology, pages 75-83. ACM, 1997.
4. M. R Garey and D. S. Johnson. Computers and intractability - A guide to the theory of NP-completeness. Freeman, San Francisco, 1979.
5. W. H. Gates and C. H. Papadimitriou. Bounds for sorting by prefix reversal. Discrete Mathematics, 27:47-57, 1979.
6. R. Gobi, S. Lati, and W. W. Bein. Adaptive sorting algorithms for evaluation of automatic zoning employed in OCR devices. In Proceedings of the 2000 International Conference on Imaging Science, Systems, and Technology, pages 253-259. CSREA Press, 2000.
7. L.S. Heath and J.P.C. Vergara. Sorting by bounded block-moves. Discrete Applied Mathematics, 88:181-206, 1998.
8. L.S. Heath and J.P.C. Vergara. Sorting by short block-moves. Algorithmics, 28 (3):323-354, 2000.
9. H. Heydari and I. H. Sudborough. On the diameter of the pancake network. Journal of Algorithms, 25(1):67-94, 1997.
10. J. Kanai, S. V. Rice, and T.A. Nartker. Automatic evaluation of OCR zoning. IEEE Transactions on Pattern Analysis and Machine Intelligence, 17 (1):86-90, 1995.
11. S. Latifi. How can permutations be used in the evaluation of automatic zoning evaluation? In ICEE 1993. Amir Kabir University, 1993.