Методы генетического картирования на основе SNP-маркеров

Анотація

Aims. The appearance of SNP-markers leads to the increasing of density of existing genetic maps and simultaneously has generated two major problems. The first problem is technical; associated with the processing of much more information. The second problem, algorithmic, raises the question: how to derive the expected results? Methods. Two algorithms of genetic mapping are proposed. One of them aims to maps building without any bound-together markers. It is based on the removing of all the markers from some area of chosen markers. The second method is applied when there are some groups of bound-together markers. It is based on the use of one representative from each set of bound-together markers. Results. Both methods allow solving of the problem; however the second method can only work at a reasonable population size, which does not lead to the total destruction of the sets of bound-together markers. Maps can be built by this method with very high precision. Moreover, this method uses earlier developed algorithms. Conclusions. Specified level of errors in the identification of alleles of SNP-markers limits the density of markers on the genetic map by some value that is independent of population size.

Key words: SNP-markers, genetic mapping, bound-together markers.