Sciweavers

Share
BIOCOMP
2006

Improving the Efficiency of Sorting by Reversals

9 years 5 months ago
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.
Yijie Han
Added 30 Oct 2010
Updated 30 Oct 2010
Type Conference
Year 2006
Where BIOCOMP
Authors Yijie Han
Comments (0)
books