Sciweavers

11 search results - page 3 / 3
» A fast algorithm for the multiple genome rearrangement probl...
Sort
View
RECOMB
2007
Springer
14 years 5 months ago
How to Achieve an Equivalent Simple Permutation in Linear Time
The problem of Sorting signed permutations by reversals is a well studied problem in computational biology. The first polynomial time algorithm was presented by Hannenhalli and Pev...
Simon Gog, Martin Bader