Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

BIOCOMP
2006

favoriteEmaildiscussreport

119views Bioinformatics» more BIOCOMP 2006»

Improving the Efficiency of Sorting by Reversals

13 years 5 months ago

Improving the Efficiency of Sorting by Reversals

Download ww1.ucmss.com

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

Real-time Traffic

BIOCOMP 2006 | BIOCOMP 2007 | Computationial Molecular Biology | Improved Algorithm | Signed Permutations |

claim paper

Related Content

» A more efficient algorithm for perfect sorting by reversals

» Improved bounds on sorting by lengthweighted reversals

» Reversible Watermarking Method Using Optimal Histogram Pair Shifting Based on Prediction a...

» Sorting by Reversals in Subquadratic Time

» Advances on sorting by reversals

» Efficient TrieBased Sorting of Large Sets of Strings

» On the efficient construction of quasireversible automata for reversible languages

» Listing All Parsimonious Reversal Sequences New Algorithms and Perspectives

» Revisiting Globally Sorted Indexes for Efficient Document Retrieval

Post Info
More Details (n/a)

Added	30 Oct 2010
Updated	30 Oct 2010
Type	Conference
Year	2006
Where	BIOCOMP
Authors	Yijie Han

Comments (0)