Change search
ReferencesLink to record
Permanent link

Direct link
(1+eps)-approximation of sorting by reversals and transpositions
Dept. of Mathematics, Royal Institute of Technology, Stockholm.ORCID iD: 0000-0002-6444-7878
2002 (English)In: Theoretical Computer Science, ISSN 0304-3975, Vol. 289, no 1, 517-529 p.Article in journal (Refereed) Published
Abstract [en]

Gu et al. gave a 2-approximation for computing the minimal number of inversions and transpositions needed to sort a permutation. There is evidence that, from the point of view of computational molecular biology, a more adequate objective function is obtained, if transpositions are given double weight. We present a (1+eps)-approximation for this problem, based on the exact algorithm of Hannenhalli and Pevzner, for sorting by reversals only.

Place, publisher, year, edition, pages
Amsterdams, Netherlands: Elsevier, 2002. Vol. 289, no 1, 517-529 p.
Keyword [en]
Permutations, Sorting, Genome rearrangements, Reversals, Transpositions, Approximation algorithm
National Category
URN: urn:nbn:se:oru:diva-41762DOI: 10.1016/S0304-3975(01)00338-3ISI: 000178999300023ScopusID: 2-s2.0-0037163953OAI: diva2:781049
Available from: 2015-01-15 Created: 2015-01-15 Last updated: 2015-09-25Bibliographically approved

Open Access in DiVA

fulltext(228 kB)13 downloads
File information
File name FULLTEXT01.pdfFile size 228 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Eriksen, Niklas
In the same journal
Theoretical Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 13 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 125 hits
ReferencesLink to record
Permanent link

Direct link