Heuristics for the Transposition Distance Problem

@article{Dias2013HeuristicsFT,
  title={Heuristics for the Transposition Distance Problem},
  author={Ulisses Dias and Zanoni Dias},
  journal={Journal of bioinformatics and computational biology},
  year={2013},
  volume={11 5},
  pages={
          1350013
        }
}
Transpositions are large-scale mutational events that occur when a block of genes moves from a region of a chromosome to another region within the same chromosome. The transposition distance problem is the minimum number of transpositions required to transform one genome into another. Recently, Bulteau et al. [Bulteau L, Fertin G, Rusu U, Automata, Languages and Programming, Vol. 6755 of Lecture Notes in Computer Science, pp. 654-665, Springer Berlin, Heidelberg, 2011] proved that finding the… CONTINUE READING