Improving the Efficiency of Sorting by Reversals

Sorting signed permutations by reversals is a fundamental problem in computationial molecular biology. In this paper we present an improved algorithm for sorting by reversals. Our algorithm runs in O(n3/2 ) times. This improves the best previous results which runs in O(n3/2 log n) time.

• Type: Conference
• Year: 2006
• Where: BIOCOMP
• Authors: Yijie Han
• Keywords: BIOCOMP 2006, BIOCOMP 2007, Computationial Molecular Biology, Improved Algorithm, Signed Permutations