Efficient Data Structures and a New Randomized Approach for Sorting Signed Permutations
by
Haim Kaplan
,
Elad Verbin
| Citations: | 4 - 0 self |
BibTeX
@MISC{Kaplan_efficientdata,
author = {Haim Kaplan and Elad Verbin},
title = {Efficient Data Structures and a New Randomized Approach for Sorting Signed Permutations},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
The problem of sorting signed permutations by reversals (SBR) is a fundamental problem in computational molecular biology. The goal is, given two genomes (represented as permutations of the gene collection), to find the most parsimonious scenario of reversals that transforms one genome into the other.
