@techreport{TR-IC-11-12,
   number = {IC-11-12},
   author = {Christian Baudet and Zanoni Dias},
   title  =  {{Partial  Enumeration  of  Traces  of  Solutions for the
                   Problem of Sorting by Signed Reversals}},
   month = {May},
   year = {2011},
   institution = {Institute of Computing, University of Campinas},
   note = {In English, 20 pages.
    \par\selectlanguage{english}\textbf{Abstract}
       Traditional  algorithms  to  solve  the  problem  of sorting by
       signed  reversals  output  just one optional solution while the
       space   of  optimal  solutions  can  be  huge.  Algorithms  for 
       enumerating  the  complete  set  of  traces  of  solutions were
       developed  with  the  objective of supporting the biologists in
       their studies of alternative evolutionary scenarios. Due to the
       exponential  complexity  of the algorithms, their practical use
       is  limited to small permutations. In this work, we propose and
       evaluate  three  different  approaches  for producing a partial
       enumeration of the complete set of traces of a permutation.
  }
}