“…Several algorithms to obtain approximate solutions for ordering markers have been proposed, including simulated annealing (Thompson, 1984;Weeks and Lange, 1987), stepwise likelihood (Lathrop et al, 1984), branch and bound (Lathrop et al, 1985), try and ripple , seriation (SER) (Buetow and Chakravarti, 1987), rapid chain delineation (RCD) (Doerge, 1996), genetic and evolutionary algorithm (Mester et al, 2003), recombination counting and ordering (RECORD) (Van Os et al, 2005) and unidirectional growth (UG) (Tan and Fu, 2006). Some of them have been implemented into friendly user softwares, such as Linkage (Lathrop et al, 1984), MAPMAKER/EXP , JoinMap (Stam, 1993), Emap from the program suite QTL Cartographer (Basten et al, 2003) and OneMap (Margarido et al, 2007). Moreover, there are several criteria to evaluate and compare the orders, such as, sum of adjacent recombination fractions (SARF, Falk, 1989), product of adjacent recombination fractions (PARF, Wilson, 1988), sum of adjacent LOD scores (SALOD, Weeks and Lange, 1987), SALOD-equivalent number of fully informative meiosis (SALEQ, Edwards, 1971;Olson and Boehnke, 1990), SALOD-polymorphism information content (SALPIC, Botstein et al, 1980;Olson and Boehnke, 1990), likelihood through hidden Markov chains (LHMC, , least squares (Weeks and Lange, 1987) and weighted least squares (Stam, 1993).…”