Graph-based data selection for the construction of genomic prediction models

Genetics

Volumn 185, Issue 4, 2010, Pages 1463-1475

  Maenhout, Steven ^a   De Baets, Bernard ^b   Haesaert, Geert ^a  

^a UNIVERSITY COLLEGE GHENT   (Belgium)

^b GHENT UNIVERSITY   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

MOLECULAR MARKER;

ACCURACY; ARTICLE; CROSS BREEDING; GENOME ANALYSIS; HOMOZYGOTE; MAIZE; NONHUMAN; PHENOTYPE; PRIORITY JOURNAL; QUALITATIVE ANALYSIS; SIMULATION;

ALGORITHMS; ANIMALS; BREEDING; COMPUTER GRAPHICS; COMPUTER SIMULATION; CROPS, AGRICULTURAL; GENETIC MARKERS; GENOME; GENOTYPE; HYBRIDIZATION, GENETIC; MODELS, GENETIC; PHENOTYPE; REPRODUCIBILITY OF RESULTS; ZEA MAYS;

ANIMALIA; ZEA MAYS;

EID: 78751638903     PISSN: 00166731     EISSN: 00166731     Source Type: Journal    
DOI: 10.1534/genetics.110.116426     Document Type: Article

References (40)

1. ASAHIRO, Y., K. IWAMA, H. TAMAKI and T. TOKUYAMA, 2000 Greedily finding a dense subgraph. Algorithmica 34: 203-221.
2. BATTITI, R., and M. PROTASI, 2001 Reactive local search for the maximum clique problem. Algorithmica 29: 610-637.
3. BERNARDO, R., 1994 Prediction of maize single-cross performance using RFLPs and information from related hybrids. Crop Sci. 34: 20-25.
4. BERNARDO, R., 1995 Genetic models for predicting maize single-cross performance in unbalanced yield trial data. Crop Sci. 35: 141-147.
5. BERNARDO, R., 1996 Best linear unbiased prediction of the performance of crosses between untested maize inbreds. Crop Sci. 36: 50-56.
6. BERNARDO, R., 2008 Molecular markers and selection for complex traits in plants: learning from the last 20 years. Crop Sci. 48: 1649-1664.
7. BOMZE, M., M. BUDINICH, P. PARDALOS and M. PELILLO, 1999 The maximum clique problem, pp. 1-74 in Handbook of Combinatorial Optimization, Supplement Vol. A, edited by D.-Z. DU and P. M. PARDALOS. Kluwer Academic, Dordrecht, The Netherlands.
8. BRÉLAZ, D., 1979 New methods to color the vertices of a graph. Commun. Assoc. Comput. Mach. 22: 251-256.
9. BUENO FILHO, S., and S. G. GILMOUR, 2003 Planning incomplete block experiments when treatments are genetically related. Biometrics 59: 375-381.
10. CARRAGHAN, R., and P. M. PARDALOS, 1990 An exact algorithm for the maximum clique problem. Oper. Res. Lett. 9: 375-382.
11. CHAKRABARTI, M. C., 1964 On the C-matrix in design of experiments. J. Indian. Statist. Assoc. 1: 8-23.
12. CLAUSET, A., C. R. SHALIZI and M. E. J. NEWMAN, 2009 Power-law distributions in empirical data. SIAM Rev. 51: 661-703.
13. DE MEYER, H., H. NAESSENS and B. DE BAETS, 2004 Algorithms for computing the min-transitive closure and associated partition tree of a symmetric fuzzy relation. Eur. J. Oper. Res. 155: 226-238.
14. ERKUT, E., 1990 The discrete p-dispersion problem. Eur. J. Oper. Res. 46: 48-60.
15. ERKUT, E., Y. ULKUSAL and O. YENICERIOGLU, 1994 A comparison of p-dispersion heuristics. Comput. Oper. Res. 21: 1103-1113.
16. FEIGE, U. and M. SELTSER, 1997 On the densest k-subgraph problem. Technical Report CS97-16, Weizmann Institute, Rehovot, Israel.
17. FOULLEY, J., J. BOUIX, B. GOFFINET and J. M. ELSEN, 1990 Connectedness in genetic evaluation, pp. 277-308 in Advances in Statistical Methods for Genetic Improvement of Livestock, edited by D. GIANOLA and K. HAMMOND, Springer-Verlag, Heidelberg.
18. GIANOLA, D., and J. B. C. H. M. VAN KAAM, 2008 Reproducing kernel Hilbert spaces regression methods for genomic assisted prediction of quantitative traits. Genetics 178: 2289-2303.
19. HAYES, B. J., P. J. BOWMAN, A. J. CHAMBERLAIN and M. E. GODDARD, 2009 Genomic selection in dairy cattle: progress and challenges. J. Dairy Sci. 92: 433-443.
20. HEILIGERS, B., 1991 A note on connectedness of block designs. Metrika 38: 377-381.
21. HENDERSON, C. R., 1975 Best linear unbiased estimation and prediction under a selection model. Biometrics 31: 423-447.
22. HENDERSON, C. R., 1984 Applications of Linear Models in Animal Breeding. University of Guelph Press, Guelph, Ontario, Canada.
23. JENSEN, T., and B. TOFT, 1995 Graph Coloring Problems. Wiley, New York.
24. KENNEDY, B., and D. TRUS, 1993 Considerations on genetic connectedness between management units under an animal model. J. Anim. Sci. 71: 2341-2352.
25. LALOÉ, D., 1993 Precision and information in linear models of genetic evaluation. Genet. Sel. Evol. 25: 557-576.
26. LALOÉ, D., F. PHOCAS and F. MÉNISSIER, 1996 Considerations about measures of precision and connection in mixed linear models of genetic evaluation. Genet. Sel. Evol. 28: 359-378.
27. LESCOVEC, J., and C. FALOUTSOS, 2006 Sampling from large graphs, pp. 631-636 in Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Association of Computing Machinery, New York.
28. MAENHOUT, S., B. DE BAETS, G. HAESAERT and E. VAN BOCKSTAELE, 2007 Support vector machine regression for the prediction of maize hybrid performance. Theor. Appl. Genet. 115: 1003-1013.
29. MAENHOUT, S., B. DE BAETS, G. HAESAERT and E. VAN BOCKSTAELE, 2008 Marker-based screening of maize inbred lines using support vector machine regression. Euphytica 161: 123-131.
30. MAENHOUT, S., B. DE BAETS and G. HAESAERT, 2009 Marker-based estimation of the coefficient of coancestry in hybrid breeding programmes. Theor. Appl. Genet. 118: 1181-1192.
31. MAENHOUT, S., B. DE BAETS and G. HAESAERT, 2010 Prediction of maize single-cross hybrid performance: support vector machine regression versus best linear prediction. Theor. Appl. Genet. 120: 415-427.
32. MEUWISSEN, T. H. E., B. J. HAYES and M. E. GODDARD, 2001 Prediction of total genetic value using genome-wide dense marker maps. Genetics 157: 1819-1829.
33. NAESSENS, H., H. DE MEYER and B. DE BAETS, 2002 Algorithms for the computation of T-transitive closures. IEEE Trans. Fuzzy Syst. 10: 541-551.
34. ÖSTERGÅRD, P. R. J., 2002 A fast algorithm for the maximum clique problem. Discrete Appl. Math. 120: 197-207.
35. PATTERSON, H. D., and R. THOMPSON, 1971 Recovery of interblock information when block sizes are equal. Biometrika 58: 545-554.
36. RAVI, S., D. ROSENKRANTZ and G. TAYI, 1991 Facility dispersion problems: heuristics and special cases. Lecture Notes Comput. Sci. 519: 355-366.
37. STICH, B., A. E. MELCHINGER, H. P. PIEPHO, S. HAMRIT, W. SCHIPPRACK et al., 2007 Potential causes of linkage disequilibrium in a european maize breeding program investigated with computer simulations. Theor. Appl. Genet. 115: 529-536.
38. TOMITA, E., and T. SEKI, 2003 An efficient branch-and-bound algorithm for finding a maximum clique. DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 2731: 278-289.
39. WARSHALL, S., 1962 A theorem on Boolean matrices. J. Assoc. Comput. Mach. 9: 11-12.
40. YU, J., G. PRESSOIR, W. H. BRIGGS, I. VROH BI, M. YAMASAKI et al., 2006 A unified mixed-model method for association mapping that accounts for multiple levels of relatedness. Nat. Genet. 38: 203-208.