Sorting by transpositions: dealing with length-weighted models
by Xingqin Qi, Jichang Wu, Shuguang Li, Guojun Li
International Journal of Bioinformatics Research and Applications (IJBRA), Vol. 4, No. 2, 2008

Abstract: For the first time, we study the sorting of permutations by length-weighted transpositions under a wide class of cost functions, namely f(l)=l^α, where l is the length of the transposition. For different α, we give corresponding upper and lower bounds of the cost of sorting any binary sequences or any permutations. Furthermore, an O(log n) approximation algorithm and an exact algorithm are given to determine the optimal transposition series of sorting a permutation of length n when 1 < α < 2 and α ≥ 2 respectively. Our work poses some interesting questions to both biologists and computer scientists and suggests some new bioinformatic insights that are currently being studied.

Online publication date: Sat, 17-May-2008

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Bioinformatics Research and Applications (IJBRA):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com