Sorting by Bounded Block-Moves

Simple item page
dc.contributor.authorHeath, Lenwood S.en
dc.contributor.authorVergara, John Paul C.en
dc.contributor.departmentComputer Scienceen
dc.date.accessioned2013-06-19T14:37:17Zen
dc.date.available2013-06-19T14:37:17Zen
dc.date.issued1997-05-01en
dc.description.abstractGiven a permutation pi, a block-move is an operation that switches two adjacent blocks of elements in pi. The problem of finding the minimum number of block-moves required to sort pi has applications in computational biology, particularly in the study of genome rearrangements. This paper investigates variants of the problem where bounds are imposed on the lengths of the blocks moved. Algorithms and reduction results are presented for these variants.en
dc.format.mimetypeapplication/postscripten
dc.identifierhttp://eprints.cs.vt.edu/archive/00000466/en
dc.identifier.sourceurlhttp://eprints.cs.vt.edu/archive/00000466/01/TR-97-09.psen
dc.identifier.trnumberTR-97-09en
dc.identifier.urihttp://hdl.handle.net/10919/19893en
dc.language.isoenen
dc.publisherDepartment of Computer Science, Virginia Polytechnic Institute & State Universityen
dc.relation.ispartofHistorical Collection(Till Dec 2001)en
dc.rightsIn Copyrighten
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.titleSorting by Bounded Block-Movesen
dc.typeTechnical reporten
dc.type.dcmitypeTexten

Files

Original bundle
Now showing 1 - 1 of 1
Name:
TR-97-09.ps
Size:
247 KB
Format:
Postscript Files
Download

Collections

Computer Science Technical Reports