Data/hora: 16/06/2024 06:30:10

Provedor de dados: | 74
País: | Brazil
Título: | Comparison between simulated annealing algorithms and rapid chain delineation in the construction of genetic maps
Autores: | Nascimento,Moysés; Cruz,Cosme Damião; Peternelli,Luiz Alexandre; Campana,Ana Carolina Mota.
Data: | 2010-01-01
Ano: | 2010
Palavras-chave: | Better order; Genetic mapping; Genomic analyses; Stochastic optimization.
Resumo: | The efficiency of simulated annealing algorithms and rapid chain delineation in establishing the best linkage order, when constructing genetic maps, was evaluated. Linkage refers to the phenomenon by which two or more genes, or even more molecular markers, can be present in the same chromosome or linkage group. In order to evaluate the capacity of algorithms, four F2 co-dominant populations, 50, 100, 200 and 1000 in size, were simulated. For each population, a genome with four linkage groups (100 cM) was generated. The linkage groups possessed 51, 21, 11 and 6 marks, respectively, and a corresponding distance of 2, 5, 10 and 20 cM between adjacent marks, thereby causing various degrees of saturation. For very saturated groups, with an adjacent distance between marks of 2 cM and in greater number, i.e., 51, the method based upon stochastic simulation by simulated annealing presented orders with distances equivalent to or lower than rapid chain delineation. Otherwise, the two methods were commensurate through presenting the same SARF distance.
Tipo: | Info:eu-repo/semantics/article
Idioma: | Inglês
Identificador: | http://www.scielo.br/scielo.php?script=sci_arttext&pid=S1415-47572010000200032
Editor: | Sociedade Brasileira de Genética
Relação: | 10.1590/S1415-47572010005000033
Formato: | text/html
Fonte: | Genetics and Molecular Biology  v.33 n.2 2010
Fonte: | info:eu-repo/semantics/openAccess