Some Experiments on the Sorting by Reversals Method

dc.contributor.authorHeath, Lenwood S.en
dc.contributor.authorVergara, John Paul C.en
dc.contributor.departmentComputer Scienceen
dc.date.accessioned2013-06-19T14:36:26Zen
dc.date.available2013-06-19T14:36:26Zen
dc.date.issued1995-09-01en
dc.description.abstractSorting by reversals is the problem of finding the minimum number of reversals required to sort a permutation pi. The problem is significant with respect to the study of genome rearrangements and phylogeny reconstruction. This paper presents a programming framework for performing experiments on the problem. Several conjectures concerning optimal sorting sequences are tested using this framework.en
dc.format.mimetypeapplication/postscripten
dc.identifierhttp://eprints.cs.vt.edu/archive/00000431/en
dc.identifier.sourceurlhttp://eprints.cs.vt.edu/archive/00000431/01/TR-95-16.psen
dc.identifier.trnumberTR-95-16en
dc.identifier.urihttp://hdl.handle.net/10919/19938en
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.titleSome Experiments on the Sorting by Reversals Methoden
dc.typeTechnical reporten
dc.type.dcmitypeTexten
Files
Original bundle
Now showing 1 - 1 of 1
Name:
TR-95-16.ps
Size:
136.2 KB
Format:
Postscript Files