메뉴 건너뛰기




Volumn 14, Issue 3, 2003, Pages 425-437

Block sorting is hard

Author keywords

mathcal NP completeness; block sorting; optical character recognition; Optimal sorting

Indexed keywords


EID: 26844516676     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129054103001820     Document Type: Conference Paper
Times cited : (11)

References (11)
  • 2
    • 0030130366 scopus 로고    scopus 로고
    • Genome rearrangements and sorting by reversals
    • V. Bafna and P.A. Pevzner. Genome rearrangements and sorting by reversals.SIAM Journal on Computing, 25:272-289, 1999
    • (1999) SIAM Journal on Computing , vol.25 , pp. 272-289
    • Bafna, V.1    Pevzner, P.A.2
  • 8
    • 0242575352 scopus 로고    scopus 로고
    • Sorting by short block-moves
    • L.S. Heath and J.P.C. Vergara. Sorting by short block-moves. Algorithmics, 28(3):323-354, 2000
    • (2000) Algorithmics , vol.28 , Issue.3 , pp. 323-354
    • Heath, L.S.1    Vergara, J.P.C.2
  • 9
    • 0038643654 scopus 로고    scopus 로고
    • On the diameter of the pancake network
    • H. Heydari and I. H. Sudborough. On the diameter of the pancake network. Journalof Algorithms, 25(l):67-94, 1997
    • (1997) Journalof Algorithms , vol.25 , Issue.1 , pp. 67-94
    • Heydari, H.1    Sudborough, I.H.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.