Highly Influential

- Published 2007 in RECOMB-CG
DOI:10.1007/978-3-540-74960-8_5

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 Pevzner in 1995 [5]. The algorithm was improved several times, and nowadays the most efficient algorithm has a subquadratic running time [9, 8]. Simple permutations played an… CONTINUE READING

### Presentations referencing similar topics