56 search results - page 1 / 12 » The Solution Space of Sorting by Reversals |
ISBRA
2007
Springer
13 years 11 months ago
2007
Springer
DAM
2007
13 years 4 months ago
2007
Theproblemofsortingsignedpermutationsbyreversalsisinspiredbygenomerearrangementproblemsincomputationalmolecular biology. Given two genomes represented as signed permutations of th...
CPM
2004
Springer
13 years 8 months ago
2004
Springer
The problem of sorting a signed permutation by reversals is inspired by genome rearrangements in computational molecular biology. Given two genomes represented as two signed permut...
SSD
2009
Springer
13 years 9 months ago
2009
Springer
In this paper, we formalize the novel concept of incremental reverse nearest neighbor ranking and suggest an original solution for this problem. We propose an efficient approach f...
CPM
2001
Springer
13 years 9 months ago
2001
Springer
In 1995, Hannenhalli and Pevzner gave a first polynomial solution to the problem of finding the minimum number of reversals needed to sort a signed permutation.Their solution, a...