Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

RECOMB
2005
Springer

favoriteEmaildiscussreport

129views Computational Biology» more RECOMB 2005»

On Sorting by Translocations

14 years 4 months ago

On Sorting by Translocations

Download www.techfak.uni-bielefeld.de

The study of genome rearrangements is an important tool in comparative genomics. This paper revisits the problem of sorting a multichromosomal genome by translocations, i.e. exchanges of chromosome ends. We give an elementary proof of the formula for computing the translocation distance in linear time, and we give a new algorithm for sorting by translocations, correcting an error in a previous algorithm by Hannenhalli.

Anne Bergeron, Julia Mixtacki, Jens Stoye

Real-time Traffic

Chromosome Ends | Comparative Genomics | Computational Biology | Important Tool | RECOMB 2005 |

claim paper

Related Content

» Sorting by Reciprocal Translocations via Reversals Theory

» Sorting by Translocations Via Reversals Theory

» Sorting Genomes with Centromeres by Translocations

» Efficient sorting of genomic permutations by translocation inversion and block interchange

» Counting All DCJ Sorting Scenarios

» The Problem of Chromosome Reincorporation in DCJ Sorting and Halving

» Dependence of paracentric inversion rate on tract length

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2005
Where	RECOMB
Authors	Anne Bergeron, Julia Mixtacki, Jens Stoye

Comments (0)