Signed genome rearrangement by reversals and transpositions: Models and approximations?

Guo Hui Lin, Guoliang Xue

Research output: Chapter in Book/Report/Conference proceedingConference contribution

8 Citations (Scopus)

Abstract

An important problem in computational molecular biology is the genome rearrangement using reversals and transpositions. Analysis of genome evolving by inversions and transpositions leads to a combina- torial optimization problem of sorting by reversals and transpositions, i.e., sorting of a permutation using reversals and transpositions of arbi- trary 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 oper- ation deletes a segment of the genome and insert it into another position in the genome. The second kind of transposition operation deletes a seg- ment of the genome and insert its inverse into another position in the genome. Both transposition operations can be viewed as operations work- ing on two consecutive segments. A third transposition operation working on two consecutive segments is introduced which, together with reversal and the first two kinds of transposition operations, forms the complete set of operations on two consecutive segments. In this paper, we study the sorting of a signed permutation by reversals and transpositions. By allowing only the first kind of transpositions, or the first two kinds of transpositions, or all three kinds of transpositions, we have three prob- lem models. After establishing a common lower bound on the numbers 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)
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages71-80
Number of pages10
Volume1627
ISBN (Print)3540662006, 9783540662006
DOIs
StatePublished - 1999
Externally publishedYes
Event5th Annual International Conference on Computing and Combinatorics, COCOON 1999 - Tokyo, Japan
Duration: Jul 26 1999Jul 28 1999

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1627
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other5th Annual International Conference on Computing and Combinatorics, COCOON 1999
CountryJapan
CityTokyo
Period7/26/997/28/99

Fingerprint

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

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Lin, G. H., & Xue, G. (1999). Signed genome rearrangement by reversals and transpositions: Models and approximations? In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1627, pp. 71-80). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1627). Springer Verlag. https://doi.org/10.1007/3-540-48686-0_7

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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1627 Springer Verlag, 1999. p. 71-80 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1627).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Lin, GH & Xue, G 1999, Signed genome rearrangement by reversals and transpositions: Models and approximations? in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 1627, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1627, Springer Verlag, pp. 71-80, 5th Annual International Conference on Computing and Combinatorics, COCOON 1999, Tokyo, Japan, 7/26/99. https://doi.org/10.1007/3-540-48686-0_7
Lin GH, Xue G. Signed genome rearrangement by reversals and transpositions: Models and approximations? In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1627. Springer Verlag. 1999. p. 71-80. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/3-540-48686-0_7
Lin, Guo Hui ; Xue, Guoliang. / Signed genome rearrangement by reversals and transpositions : Models and approximations?. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1627 Springer Verlag, 1999. pp. 71-80 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{50a08cc852a3459b8f1d4185e01f8414,
title = "Signed genome rearrangement by reversals and transpositions: Models and approximations?",
abstract = "An important problem in computational molecular biology is the genome rearrangement using reversals and transpositions. Analysis of genome evolving by inversions and transpositions leads to a combina- torial optimization problem of sorting by reversals and transpositions, i.e., sorting of a permutation using reversals and transpositions of arbi- trary 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 oper- ation deletes a segment of the genome and insert it into another position in the genome. The second kind of transposition operation deletes a seg- ment of the genome and insert its inverse into another position in the genome. Both transposition operations can be viewed as operations work- ing on two consecutive segments. A third transposition operation working on two consecutive segments is introduced which, together with reversal and the first two kinds of transposition operations, forms the complete set of operations on two consecutive segments. In this paper, we study the sorting of a signed permutation by reversals and transpositions. By allowing only the first kind of transpositions, or the first two kinds of transpositions, or all three kinds of transpositions, we have three prob- lem models. After establishing a common lower bound on the numbers 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.",
author = "Lin, {Guo Hui} and Guoliang Xue",
year = "1999",
doi = "10.1007/3-540-48686-0_7",
language = "English (US)",
isbn = "3540662006",
volume = "1627",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "71--80",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Signed genome rearrangement by reversals and transpositions

T2 - Models and approximations?

AU - Lin, Guo Hui

AU - Xue, Guoliang

PY - 1999

Y1 - 1999

N2 - An important problem in computational molecular biology is the genome rearrangement using reversals and transpositions. Analysis of genome evolving by inversions and transpositions leads to a combina- torial optimization problem of sorting by reversals and transpositions, i.e., sorting of a permutation using reversals and transpositions of arbi- trary 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 oper- ation deletes a segment of the genome and insert it into another position in the genome. The second kind of transposition operation deletes a seg- ment of the genome and insert its inverse into another position in the genome. Both transposition operations can be viewed as operations work- ing on two consecutive segments. A third transposition operation working on two consecutive segments is introduced which, together with reversal and the first two kinds of transposition operations, forms the complete set of operations on two consecutive segments. In this paper, we study the sorting of a signed permutation by reversals and transpositions. By allowing only the first kind of transpositions, or the first two kinds of transpositions, or all three kinds of transpositions, we have three prob- lem models. After establishing a common lower bound on the numbers 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 molecular biology is the genome rearrangement using reversals and transpositions. Analysis of genome evolving by inversions and transpositions leads to a combina- torial optimization problem of sorting by reversals and transpositions, i.e., sorting of a permutation using reversals and transpositions of arbi- trary 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 oper- ation deletes a segment of the genome and insert it into another position in the genome. The second kind of transposition operation deletes a seg- ment of the genome and insert its inverse into another position in the genome. Both transposition operations can be viewed as operations work- ing on two consecutive segments. A third transposition operation working on two consecutive segments is introduced which, together with reversal and the first two kinds of transposition operations, forms the complete set of operations on two consecutive segments. In this paper, we study the sorting of a signed permutation by reversals and transpositions. By allowing only the first kind of transpositions, or the first two kinds of transpositions, or all three kinds of transpositions, we have three prob- lem models. After establishing a common lower bound on the numbers 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.

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

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

U2 - 10.1007/3-540-48686-0_7

DO - 10.1007/3-540-48686-0_7

M3 - Conference contribution

AN - SCOPUS:84957795611

SN - 3540662006

SN - 9783540662006

VL - 1627

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 71

EP - 80

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

PB - Springer Verlag

ER -