Of mice and men: Algorithms for evolutionary distances between genomes with translocation

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

73 Citations (Scopus)

Abstract

A new and largely unexplored area of computational biology is combinatorial algorithms for genome rearrangement. In the course of its evolution, the genome of an organism mutates by processes that can rearrange whole segments of a chromosome in a single event. These rearrangement mechanisms include inversion, transposition, duplication, and translocation, and a basic problem is to determine the minimum number of such events that transform one genome to another. This number is called the rearrangement distance between the two genomes, and gives a lower bound on the number of events that must have occurred since their divergence, assuming evolution proceeds according to the processes of the study.In this paper, we begin the algorithmic study of genome rearrangement by translocation. A transloca^ tion exchanges material at the end of two chromosomes within a genome. We model this as a process that exchanges prefixes and suffixes of strings, where each string represents a sequence of distinct markers along a chromosome in the genome. For the general problem of determining the translocation distance between two such sets of strings, we present a 2-approximation algorithm. For a theoretical model in which the exchanged substrings are of equal length, we derive an optimal algorithm for translocation distance. We also examine for the first time two types of rearrangements in concert. An inversion reverses the order of markers within a substring, and flips the orientation of the markers. For genomes that have evolved by translocation and inversion, we show there is a simple 2-approximation algorithm for data in which the orientation of markers is unknown, and a |-approximation algorithm when orientation is known. These results take a step towards extending the area from the analysis of simple organisms, whose genomes consist of a single chromosome, and whose evolution has largely involved a single type of rearrangement event, to the analysis of organisms such as man and mouse, whose genomes contain many chromosomes, and whose history since divergence has largely consisted of inversion and translocation events.

Original languageEnglish (US)
Title of host publicationProceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1995
PublisherAssociation for Computing Machinery
Pages604-613
Number of pages10
VolumePart F129524
ISBN (Electronic)0898713498
StatePublished - Jan 22 1995
Externally publishedYes
Event6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1995 - San Francisco, United States
Duration: Jan 22 1995Jan 24 1995

Other

Other6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1995
CountryUnited States
CitySan Francisco
Period1/22/951/24/95

Fingerprint

Translocation
Mouse
Genome
Genes
Chromosome
Chromosomes
Rearrangement
Inversion
Genome Rearrangement
Approximation Algorithms
Approximation algorithms
Strings
Divergence
Suffix
Combinatorial Algorithms
Transposition
Computational Biology
Prefix
Duplication
Flip

ASJC Scopus subject areas

  • Software
  • Mathematics(all)

Cite this

Kececioglu, J. D., & Ravi, R. (1995). Of mice and men: Algorithms for evolutionary distances between genomes with translocation. In Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1995 (Vol. Part F129524, pp. 604-613). Association for Computing Machinery.

Of mice and men : Algorithms for evolutionary distances between genomes with translocation. / Kececioglu, John D; Ravi, R.

Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1995. Vol. Part F129524 Association for Computing Machinery, 1995. p. 604-613.

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

Kececioglu, JD & Ravi, R 1995, Of mice and men: Algorithms for evolutionary distances between genomes with translocation. in Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1995. vol. Part F129524, Association for Computing Machinery, pp. 604-613, 6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1995, San Francisco, United States, 1/22/95.
Kececioglu JD, Ravi R. Of mice and men: Algorithms for evolutionary distances between genomes with translocation. In Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1995. Vol. Part F129524. Association for Computing Machinery. 1995. p. 604-613
Kececioglu, John D ; Ravi, R. / Of mice and men : Algorithms for evolutionary distances between genomes with translocation. Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1995. Vol. Part F129524 Association for Computing Machinery, 1995. pp. 604-613
@inproceedings{b6d3160862f347d593646b98e6770eaa,
title = "Of mice and men: Algorithms for evolutionary distances between genomes with translocation",
abstract = "A new and largely unexplored area of computational biology is combinatorial algorithms for genome rearrangement. In the course of its evolution, the genome of an organism mutates by processes that can rearrange whole segments of a chromosome in a single event. These rearrangement mechanisms include inversion, transposition, duplication, and translocation, and a basic problem is to determine the minimum number of such events that transform one genome to another. This number is called the rearrangement distance between the two genomes, and gives a lower bound on the number of events that must have occurred since their divergence, assuming evolution proceeds according to the processes of the study.In this paper, we begin the algorithmic study of genome rearrangement by translocation. A transloca^ tion exchanges material at the end of two chromosomes within a genome. We model this as a process that exchanges prefixes and suffixes of strings, where each string represents a sequence of distinct markers along a chromosome in the genome. For the general problem of determining the translocation distance between two such sets of strings, we present a 2-approximation algorithm. For a theoretical model in which the exchanged substrings are of equal length, we derive an optimal algorithm for translocation distance. We also examine for the first time two types of rearrangements in concert. An inversion reverses the order of markers within a substring, and flips the orientation of the markers. For genomes that have evolved by translocation and inversion, we show there is a simple 2-approximation algorithm for data in which the orientation of markers is unknown, and a |-approximation algorithm when orientation is known. These results take a step towards extending the area from the analysis of simple organisms, whose genomes consist of a single chromosome, and whose evolution has largely involved a single type of rearrangement event, to the analysis of organisms such as man and mouse, whose genomes contain many chromosomes, and whose history since divergence has largely consisted of inversion and translocation events.",
author = "Kececioglu, {John D} and R. Ravi",
year = "1995",
month = "1",
day = "22",
language = "English (US)",
volume = "Part F129524",
pages = "604--613",
booktitle = "Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1995",
publisher = "Association for Computing Machinery",

}

TY - GEN

T1 - Of mice and men

T2 - Algorithms for evolutionary distances between genomes with translocation

AU - Kececioglu, John D

AU - Ravi, R.

PY - 1995/1/22

Y1 - 1995/1/22

N2 - A new and largely unexplored area of computational biology is combinatorial algorithms for genome rearrangement. In the course of its evolution, the genome of an organism mutates by processes that can rearrange whole segments of a chromosome in a single event. These rearrangement mechanisms include inversion, transposition, duplication, and translocation, and a basic problem is to determine the minimum number of such events that transform one genome to another. This number is called the rearrangement distance between the two genomes, and gives a lower bound on the number of events that must have occurred since their divergence, assuming evolution proceeds according to the processes of the study.In this paper, we begin the algorithmic study of genome rearrangement by translocation. A transloca^ tion exchanges material at the end of two chromosomes within a genome. We model this as a process that exchanges prefixes and suffixes of strings, where each string represents a sequence of distinct markers along a chromosome in the genome. For the general problem of determining the translocation distance between two such sets of strings, we present a 2-approximation algorithm. For a theoretical model in which the exchanged substrings are of equal length, we derive an optimal algorithm for translocation distance. We also examine for the first time two types of rearrangements in concert. An inversion reverses the order of markers within a substring, and flips the orientation of the markers. For genomes that have evolved by translocation and inversion, we show there is a simple 2-approximation algorithm for data in which the orientation of markers is unknown, and a |-approximation algorithm when orientation is known. These results take a step towards extending the area from the analysis of simple organisms, whose genomes consist of a single chromosome, and whose evolution has largely involved a single type of rearrangement event, to the analysis of organisms such as man and mouse, whose genomes contain many chromosomes, and whose history since divergence has largely consisted of inversion and translocation events.

AB - A new and largely unexplored area of computational biology is combinatorial algorithms for genome rearrangement. In the course of its evolution, the genome of an organism mutates by processes that can rearrange whole segments of a chromosome in a single event. These rearrangement mechanisms include inversion, transposition, duplication, and translocation, and a basic problem is to determine the minimum number of such events that transform one genome to another. This number is called the rearrangement distance between the two genomes, and gives a lower bound on the number of events that must have occurred since their divergence, assuming evolution proceeds according to the processes of the study.In this paper, we begin the algorithmic study of genome rearrangement by translocation. A transloca^ tion exchanges material at the end of two chromosomes within a genome. We model this as a process that exchanges prefixes and suffixes of strings, where each string represents a sequence of distinct markers along a chromosome in the genome. For the general problem of determining the translocation distance between two such sets of strings, we present a 2-approximation algorithm. For a theoretical model in which the exchanged substrings are of equal length, we derive an optimal algorithm for translocation distance. We also examine for the first time two types of rearrangements in concert. An inversion reverses the order of markers within a substring, and flips the orientation of the markers. For genomes that have evolved by translocation and inversion, we show there is a simple 2-approximation algorithm for data in which the orientation of markers is unknown, and a |-approximation algorithm when orientation is known. These results take a step towards extending the area from the analysis of simple organisms, whose genomes consist of a single chromosome, and whose evolution has largely involved a single type of rearrangement event, to the analysis of organisms such as man and mouse, whose genomes contain many chromosomes, and whose history since divergence has largely consisted of inversion and translocation events.

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

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

M3 - Conference contribution

AN - SCOPUS:84878713670

VL - Part F129524

SP - 604

EP - 613

BT - Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1995

PB - Association for Computing Machinery

ER -