Skip to main navigation Skip to search Skip to main content

Translocation Distance: Algorithms and Complexity

Research output: Chapters, Conference Papers, Creative and Literary WorksRGC 12 - Chapter in an edited book (Author)peer-review

Abstract

With the development of fast sequencing techniques, large-scale DNA molecules are investigated with respect to the relative order of genes in them. Contrary to the traditional alignment approach, genome rearrangements are based on comparison of gene orders and the evolution of gene families. Genome rearrangement has become an important area in computational biology and bioinformatics. There are three basic operations, reversal, translocation, and transposition. Here we study the translocation operations. Multi-chromosomal genomes frequently evolve by translocation events that exchange genetic material between two chromosomes. We will discuss both signed and unsigned cases. © 2006 Elsevier Inc. All rights reserved.
Original languageEnglish
Title of host publicationComputational Biology and Bioinformatics
Pages105-126
Volume68
DOIs
Publication statusPublished - 2006

Publication series

NameAdvances in Computers
Volume68
ISSN (Print)0065-2458

Fingerprint

Dive into the research topics of 'Translocation Distance: Algorithms and Complexity'. Together they form a unique fingerprint.

Cite this