Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Whole Genome Duplications, Multi-Break Rearrangements, and Genome Halving Problem
 

Summary: Whole Genome Duplications, Multi-Break Rearrangements, and
Genome Halving Problem
Max A. Alekseyev and Pavel A. Pevzner
Department of Computer Science and Engineering
University of California at San Diego
{maxal,ppevzner}@cs.ucsd.edu
Abstract
The Genome Halving Problem, motivated by the whole
genome duplication events in molecular evolution, was
solved by El-Mabrouk and Sankoff. The El-Mabrouk­
Sankoff algorithm is rather complex inspiring a quest for
a simpler solution. An alternative approach to Genome
Halving Problem based on the notion of the contracted
breakpoint graph was recently proposed in [2]. This new
technique reveals that while the El-Mabrouk­Sankoff re-
sult is correct in most cases, it does not hold in the case of
unichromosomal genomes. This raises a problem of cor-
recting El-Mabrouk­Sankoff analysis and devising an al-
gorithm that deals adequately with all genomes. In this pa-
per we efficiently classify all genomes into two classes and

  

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

 

Collections: Biotechnology; Computer Technologies and Information Sciences