Sorting by Bounded Block-Moves
| dc.contributor.author | Heath, Lenwood S. | en |
| dc.contributor.author | Vergara, John Paul C. | en |
| dc.contributor.department | Computer Science | en |
| dc.date.accessioned | 2013-06-19T14:37:17Z | en |
| dc.date.available | 2013-06-19T14:37:17Z | en |
| dc.date.issued | 1997-05-01 | en |
| dc.description.abstract | Given 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.mimetype | application/postscript | en |
| dc.identifier | http://eprints.cs.vt.edu/archive/00000466/ | en |
| dc.identifier.sourceurl | http://eprints.cs.vt.edu/archive/00000466/01/TR-97-09.ps | en |
| dc.identifier.trnumber | TR-97-09 | en |
| dc.identifier.uri | http://hdl.handle.net/10919/19893 | en |
| dc.language.iso | en | en |
| dc.publisher | Department of Computer Science, Virginia Polytechnic Institute & State University | en |
| dc.relation.ispartof | Historical Collection(Till Dec 2001) | en |
| dc.rights | In Copyright | en |
| dc.rights.uri | http://rightsstatements.org/vocab/InC/1.0/ | en |
| dc.title | Sorting by Bounded Block-Moves | en |
| dc.type | Technical report | en |
| dc.type.dcmitype | Text | en |
Files
Original bundle
1 - 1 of 1