Efficient bounds for oriented chromosome inversion distance

John D Kececioglu, David Sankoff

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

67 Citations (Scopus)

Abstract

We study the problem of comparing two circular chromosomes that have evolved by chromosome inversion, assuming that the order of corresponding genes is known, as well as their orientation. Determining the minimum number of inversions is equivalent to finding the minimum of reversals to sort a signed circular permutation, where a reversal takes an arbitrary substring of elements and reverses their order, as well as flipping their sign. We show that tight bounds on the minimum number of reversals can be found by simple and efficient algorithms.

Original languageEnglish (US)
Title of host publicationCombinatorial Pattern Matching - 5th Annual Symposium, CPM 1994, Proceedings
PublisherSpringer Verlag
Pages307-325
Number of pages19
Volume807 LNCS
ISBN (Print)9783540580942
StatePublished - 1994
Externally publishedYes
Event5th Annual Symposium on Combinatorial Pattern Matching, CPM 1994 - Asilomar, United States
Duration: Jun 5 1994Jun 8 1994

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume807 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other5th Annual Symposium on Combinatorial Pattern Matching, CPM 1994
CountryUnited States
CityAsilomar
Period6/5/946/8/94

Fingerprint

Chromosomes
Reversal
Chromosome
Inversion
Genes
Signed
Sort
Reverse
Permutation
Efficient Algorithms
Gene
Arbitrary

Keywords

  • Chromosome inversion
  • Genome rearrangements
  • Reversal distance
  • Sorting by signed reversals

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Kececioglu, J. D., & Sankoff, D. (1994). Efficient bounds for oriented chromosome inversion distance. In Combinatorial Pattern Matching - 5th Annual Symposium, CPM 1994, Proceedings (Vol. 807 LNCS, pp. 307-325). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 807 LNCS). Springer Verlag.

Efficient bounds for oriented chromosome inversion distance. / Kececioglu, John D; Sankoff, David.

Combinatorial Pattern Matching - 5th Annual Symposium, CPM 1994, Proceedings. Vol. 807 LNCS Springer Verlag, 1994. p. 307-325 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 807 LNCS).

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

Kececioglu, JD & Sankoff, D 1994, Efficient bounds for oriented chromosome inversion distance. in Combinatorial Pattern Matching - 5th Annual Symposium, CPM 1994, Proceedings. vol. 807 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 807 LNCS, Springer Verlag, pp. 307-325, 5th Annual Symposium on Combinatorial Pattern Matching, CPM 1994, Asilomar, United States, 6/5/94.
Kececioglu JD, Sankoff D. Efficient bounds for oriented chromosome inversion distance. In Combinatorial Pattern Matching - 5th Annual Symposium, CPM 1994, Proceedings. Vol. 807 LNCS. Springer Verlag. 1994. p. 307-325. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Kececioglu, John D ; Sankoff, David. / Efficient bounds for oriented chromosome inversion distance. Combinatorial Pattern Matching - 5th Annual Symposium, CPM 1994, Proceedings. Vol. 807 LNCS Springer Verlag, 1994. pp. 307-325 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{89cb3a770c7f4b4aa37c16bb58ff887d,
title = "Efficient bounds for oriented chromosome inversion distance",
abstract = "We study the problem of comparing two circular chromosomes that have evolved by chromosome inversion, assuming that the order of corresponding genes is known, as well as their orientation. Determining the minimum number of inversions is equivalent to finding the minimum of reversals to sort a signed circular permutation, where a reversal takes an arbitrary substring of elements and reverses their order, as well as flipping their sign. We show that tight bounds on the minimum number of reversals can be found by simple and efficient algorithms.",
keywords = "Chromosome inversion, Genome rearrangements, Reversal distance, Sorting by signed reversals",
author = "Kececioglu, {John D} and David Sankoff",
year = "1994",
language = "English (US)",
isbn = "9783540580942",
volume = "807 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "307--325",
booktitle = "Combinatorial Pattern Matching - 5th Annual Symposium, CPM 1994, Proceedings",
address = "Germany",

}

TY - GEN

T1 - Efficient bounds for oriented chromosome inversion distance

AU - Kececioglu, John D

AU - Sankoff, David

PY - 1994

Y1 - 1994

N2 - We study the problem of comparing two circular chromosomes that have evolved by chromosome inversion, assuming that the order of corresponding genes is known, as well as their orientation. Determining the minimum number of inversions is equivalent to finding the minimum of reversals to sort a signed circular permutation, where a reversal takes an arbitrary substring of elements and reverses their order, as well as flipping their sign. We show that tight bounds on the minimum number of reversals can be found by simple and efficient algorithms.

AB - We study the problem of comparing two circular chromosomes that have evolved by chromosome inversion, assuming that the order of corresponding genes is known, as well as their orientation. Determining the minimum number of inversions is equivalent to finding the minimum of reversals to sort a signed circular permutation, where a reversal takes an arbitrary substring of elements and reverses their order, as well as flipping their sign. We show that tight bounds on the minimum number of reversals can be found by simple and efficient algorithms.

KW - Chromosome inversion

KW - Genome rearrangements

KW - Reversal distance

KW - Sorting by signed reversals

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

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

M3 - Conference contribution

SN - 9783540580942

VL - 807 LNCS

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

SP - 307

EP - 325

BT - Combinatorial Pattern Matching - 5th Annual Symposium, CPM 1994, Proceedings

PB - Springer Verlag

ER -