Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
JOURNAL OF COMPUTATIONAL BIOLOGY Volume 15, Number 8, 2008
 

Summary: JOURNAL OF COMPUTATIONAL BIOLOGY
Volume 15, Number 8, 2008
Mary Ann Liebert, Inc.
Pp. 11171131
DOI: 10.1089/cmb.2008.0080
Multi-Break Rearrangements and Breakpoint
Re-Uses: From Circular to Linear Genomes
MAX A. ALEKSEYEV
ABSTRACT
Multi-break rearrangements break a genome into multiple fragments and further glue
them together in a new order. While 2-break rearrangements represent standard reversals,
fusions, fissions, and translocations, 3-break rearrangements represent a natural general-
ization of transpositions. Alekseyev and Pevzner (2007a, 2008a) studied multi-break rear-
rangements in circular genomes and further applied them to the analysis of chromosomal
evolution in mammalian genomes. In this paper, we extend these results to the more difficult
case of linear genomes. In particular, we give lower bounds for the rearrangement distance
between linear genomes and for the breakpoint re-use rate as functions of the number and
proportion of transpositions. We further use these results to analyze comparative genomic
architecture of mammalian genomes.
Key words: algorithms, combinatorics, computational molecular biology, evolution, genomic

  

Source: Alekseyev, Max - Department of Computer Science and Engineering, University of South Carolina

 

Collections: Biotechnology; Computer Technologies and Information Sciences