Signed genome rearrangement by reversals and transpositions

Models and approximations

Guo Hui Lin, Guoliang Xue

Research output: Contribution to journalArticle

30 Citations (Scopus)

Abstract

An important problem in computational biology is the genome rearrangement using reversals and transpositions. Analysis of genome evolving by reversals and transpositions leads to a combinatorial optimization problem of sorting by reversals and transpositions, i.e., sorting of a permutation using reversals and transpositions of arbitrary fragments. The reversal operation works on a single segment of the genome by reversing the selected segment. Two kinds of transpositions have been studied in the literature. The first kind of transposition operations delete a segment of the genome and insert it into another position in the genome. The second kind of transposition operations delete a segment of the genome and insert its inverse into another position in the genome. Both transposition operations can be viewed as operations working on two consecutive segments. In this paper, we introduce a third transposition operation which works on two consecutive segments and study sorting of a signed permutation by reversals and transpositions. By allowing reversals and the first kind of transpositions, or reversals and the first two kinds of transpositions, or reversals and all three kinds of transpositions, we have three problem models. After establishing a common lower bound on the number of operations needed, we present a unified 2-approximation algorithm for all these problems. Finally, we present a better 1.75-approximation for the third problem.

Original languageEnglish (US)
Pages (from-to)513-531
Number of pages19
JournalTheoretical Computer Science
Volume259
Issue number1-2
DOIs
StatePublished - 2001
Externally publishedYes

Fingerprint

Genome Rearrangement
Transposition
Signed
Reversal
Genes
Approximation
Sorting
Genome
Model
Combinatorial optimization
Approximation algorithms
Consecutive
Signed Permutations
Computational Biology
Combinatorial Optimization Problem

Keywords

  • Approximation algorithms
  • Genome rearrangement
  • Sorting of permutations

ASJC Scopus subject areas

  • Computational Theory and Mathematics

Cite this

Signed genome rearrangement by reversals and transpositions : Models and approximations. / Lin, Guo Hui; Xue, Guoliang.

In: Theoretical Computer Science, Vol. 259, No. 1-2, 2001, p. 513-531.

Research output: Contribution to journalArticle

@article{206569368b1f4e408b415b4024148cd2,
title = "Signed genome rearrangement by reversals and transpositions: Models and approximations",
abstract = "An important problem in computational biology is the genome rearrangement using reversals and transpositions. Analysis of genome evolving by reversals and transpositions leads to a combinatorial optimization problem of sorting by reversals and transpositions, i.e., sorting of a permutation using reversals and transpositions of arbitrary fragments. The reversal operation works on a single segment of the genome by reversing the selected segment. Two kinds of transpositions have been studied in the literature. The first kind of transposition operations delete a segment of the genome and insert it into another position in the genome. The second kind of transposition operations delete a segment of the genome and insert its inverse into another position in the genome. Both transposition operations can be viewed as operations working on two consecutive segments. In this paper, we introduce a third transposition operation which works on two consecutive segments and study sorting of a signed permutation by reversals and transpositions. By allowing reversals and the first kind of transpositions, or reversals and the first two kinds of transpositions, or reversals and all three kinds of transpositions, we have three problem models. After establishing a common lower bound on the number of operations needed, we present a unified 2-approximation algorithm for all these problems. Finally, we present a better 1.75-approximation for the third problem.",
keywords = "Approximation algorithms, Genome rearrangement, Sorting of permutations",
author = "Lin, {Guo Hui} and Guoliang Xue",
year = "2001",
doi = "10.1016/S0304-3975(00)00038-4",
language = "English (US)",
volume = "259",
pages = "513--531",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",
number = "1-2",

}

TY - JOUR

T1 - Signed genome rearrangement by reversals and transpositions

T2 - Models and approximations

AU - Lin, Guo Hui

AU - Xue, Guoliang

PY - 2001

Y1 - 2001

N2 - An important problem in computational biology is the genome rearrangement using reversals and transpositions. Analysis of genome evolving by reversals and transpositions leads to a combinatorial optimization problem of sorting by reversals and transpositions, i.e., sorting of a permutation using reversals and transpositions of arbitrary fragments. The reversal operation works on a single segment of the genome by reversing the selected segment. Two kinds of transpositions have been studied in the literature. The first kind of transposition operations delete a segment of the genome and insert it into another position in the genome. The second kind of transposition operations delete a segment of the genome and insert its inverse into another position in the genome. Both transposition operations can be viewed as operations working on two consecutive segments. In this paper, we introduce a third transposition operation which works on two consecutive segments and study sorting of a signed permutation by reversals and transpositions. By allowing reversals and the first kind of transpositions, or reversals and the first two kinds of transpositions, or reversals and all three kinds of transpositions, we have three problem models. After establishing a common lower bound on the number of operations needed, we present a unified 2-approximation algorithm for all these problems. Finally, we present a better 1.75-approximation for the third problem.

AB - An important problem in computational biology is the genome rearrangement using reversals and transpositions. Analysis of genome evolving by reversals and transpositions leads to a combinatorial optimization problem of sorting by reversals and transpositions, i.e., sorting of a permutation using reversals and transpositions of arbitrary fragments. The reversal operation works on a single segment of the genome by reversing the selected segment. Two kinds of transpositions have been studied in the literature. The first kind of transposition operations delete a segment of the genome and insert it into another position in the genome. The second kind of transposition operations delete a segment of the genome and insert its inverse into another position in the genome. Both transposition operations can be viewed as operations working on two consecutive segments. In this paper, we introduce a third transposition operation which works on two consecutive segments and study sorting of a signed permutation by reversals and transpositions. By allowing reversals and the first kind of transpositions, or reversals and the first two kinds of transpositions, or reversals and all three kinds of transpositions, we have three problem models. After establishing a common lower bound on the number of operations needed, we present a unified 2-approximation algorithm for all these problems. Finally, we present a better 1.75-approximation for the third problem.

KW - Approximation algorithms

KW - Genome rearrangement

KW - Sorting of permutations

UR - http://www.scopus.com/inward/record.url?scp=0034915202&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0034915202&partnerID=8YFLogxK

U2 - 10.1016/S0304-3975(00)00038-4

DO - 10.1016/S0304-3975(00)00038-4

M3 - Article

VL - 259

SP - 513

EP - 531

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - 1-2

ER -