An improved heuristic algorithm for sorting genomes with inverted block-interchanges

Abstract

A classic problem in comparative genomics is finding sequence of evolutionary operations that transform one genome into another. Analysis of genome evolving by different types of genome rearrangement operators such as reversals, transpositions, translocations, block interchange, double cut and join(DCJ) etc. leads to a shortest sequence of different types… (More)

6 Figures and Tables

Topics

  • Presentations referencing similar topics