@techreport{TR-IC-06-23,
  number = {IC-06-23},
  author = {Cleber Mira and Qian Peng and João Meidanis and Pavel Pevzner},
  title = {A shortest-cycle based heuristics for the multiple genome
            rearrangement problem},
  month = {November},
  year = {2006}, 
  institution = {Institute of Computing, University of Campinas},
  note = {In English, 14 pages.
    \par\selectlanguage{english}\textbf{Abstract}
       The multiple genome rearrangement problem consists in finding a
       phylogenetic tree that is the most ``similar'' to the
       evolutionary scenario based on rearrangeme nt events involving
       several species. Bourque and Pevzner devised an algorithm for
       the multiple genome rearrangement problem that is based on
       rearrangement events (signed reversals, translocations,
       fusions, and fissions). However, the heuristics behind their
       algorithm relies on the time-consuming procedure of searching
       \emph{good events}. We propose a simplified version of Bourque
       and Pevzner's heuristics based on experimental results that
       show that \emph{proper} signed reversals acting on short cycles
       are frequently good events. We show the results of biological
       input data sets and randomly generated data sets and argue that
       the new heuristic is faster than the good events search,
       without compromising the quality of the solutions for input
       data sets involving few genomes.
  }
}