Advanced search
Start date
Betweenand
Related content
(Reference retrieved automatically from Web of Science through information on FAPESP grant and its corresponding number as mentioned in the publication by the authors.)

Sorting by Prefix Reversals and Prefix Transpositions

Full text
Author(s):
Dias, Zanoni [1] ; Dias, Ulisses [1]
Total Authors: 2
Affiliation:
[1] Univ Estadual Campinas, Inst Comp, Campinas, SP - Brazil
Total Affiliations: 1
Document type: Journal article
Source: DISCRETE APPLIED MATHEMATICS; v. 181, p. 78-89, JAN 30 2015.
Web of Science Citations: 4
Abstract

In this paper, we present a new algorithm for the Sorting by Prefix Reversals and Prefix Transpositions Problem. The previous approximation algorithm was bounded by factor 3, and here we present an asymptotic 2-approximation algorithm. We consider theoretical and practical aspects in our analysis, and we show that our method is better than other approaches in both cases. (C) 2014 Elsevier B.V. All rights reserved. (AU)

FAPESP's process: 12/01584-3 - Genome Rearrangement Distance Problems
Grantee:Ulisses Martins Dias
Support Opportunities: Scholarships in Brazil - Post-Doctoral