@techreport{TR-IC-09-30,
   number = {IC-09-30},
   author = {Pedro Cipriano Feijão and João Meidanis},
   title    =    {Genome    Rearrangement    Phylogeny    using    the   
                   Single-Cut-or-Join operation},
   month = {September},
   year = {2009},
   institution = {Institute of Computing, University of Campinas},
   note = {In English, 9 pages.
    \par\selectlanguage{english}\textbf{Abstract}
       The  problem  of  parsimonious  phylogeny  reconstruction using
       genome  rearrangement  is  called Multiple Genome Rearrangement
       Problem.  There  are  two usual approaches: the small phylogeny
       problem,  where  a  tree  is  given  and  we  want  to find the
       ancestral  nodes that minimize total branch length of the tree;
       and  the  big phylogeny problem, finding the tree and ancestral
       nodes  with  minimum total branch length. In this paper we show
       that,  under the Single-Cut-or-Join metric, the small phylogeny
       problem  is solvable in polynomial time while the big phylogeny
       problem is NP-hard.
  }
}