Evaluation of algorithms used to order markers on genetic maps.
When building genetic maps, it is necessary to choose from several marker ordering algorithms and criteria, and the choice is not always simple. In this study, we evaluate the efficiency of algorithms try (TRY), seriation (SER), rapid chain delineation (RCD), recombination counting and ordering (RECORD) and unidirectional growth (UG), as well as the criteria PARF (product of adjacent recombination fractions), SARF (sum of adjacent recombination fractions), SALOD (sum of adjacent LOD scores) and LHMC (likelihood through hidden Markov chains), used with the RIPPLE algorithm for error verification, in the construction of genetic linkage maps. A linkage map of a hypothetical diploid and monoecious plant species was simulated containing one linkage group and 21 markers with fixed distance of 3 cM between them. In all, 700 F(2) populations were randomly simulated with 100 and 400 individuals with different combinations of dominant and co-dominant markers, as well as 10 and 20% of missing data. The simulations showed that, in the presence of co-dominant markers only, any combination of algorithm and criteria may be used, even for a reduced population size. In the case of a smaller proportion of dominant markers, any of the algorithms and criteria (except SALOD) investigated may be used. In the presence of high proportions of dominant markers and smaller samples (around 100), the probability of repulsion linkage increases between them and, in this case, use of the algorithms TRY and SER associated to RIPPLE with criterion LHMC would provide better results.
Mollinari
M
M
Departamento de Genética, Universidade de São Paulo, Piracicaba, Brazil. aafgarci@esalq.usp.br
Margarido
G R A
GR
Vencovsky
R
R
Garcia
A A F
AA
D000465:Algorithms; D002874:Chromosome Mapping / Q000379:methods*; D003198:Computer Simulation; D008040:Genetic Linkage; D005819:Genetic Markers; D008957:Models, Genetic; D010944:Plants / Q000235:genetics; D012984:Software
D005819:Genetic Markers