메뉴 건너뛰기




Volumn 39, Issue 1, 2007, Pages 3-25

Optimisation of contribution of candidate parents to maximise genetic gain and restricting inbreeding using semidefinite programming (Open Access publication)

Author keywords

Inbreeding restriction; Optimisation of contributions; Semidefinite programming

Indexed keywords

GENETIC STRUCTURE; INBREEDING; LINEAR PROGRAMING; OPTIMIZATION; REPRODUCTION;

EID: 33846209240     PISSN: 0999193X     EISSN: 12979686     Source Type: Journal    
DOI: 10.1051/gse:2006031     Document Type: Article
Times cited : (42)

References (28)
  • 1
    • 0032327612 scopus 로고    scopus 로고
    • Primal-dual interior point methods for semidefinite programming: Convergence rates, stability and numerical results
    • Alizadeh F., Haeberly J.P.A., Overton M.L., Primal-dual interior point methods for semidefinite programming: convergence rates, stability and numerical results, SIAM J. Optim. 8 (1998) 746-768.
    • (1998) SIAM J. Optim , vol.8 , pp. 746-768
    • Alizadeh, F.1    Haeberly, J.P.A.2    Overton, M.L.3
  • 2
    • 0024009859 scopus 로고
    • Selection on individual phenotype and best linear unbiased predictor of breeding value in a closed swine herd
    • Belonsky G.M., Kennedy B.W., Selection on individual phenotype and best linear unbiased predictor of breeding value in a closed swine herd, J. Anim. Sci. 66 (1988) 1124-1131.
    • (1988) J. Anim. Sci , vol.66 , pp. 1124-1131
    • Belonsky, G.M.1    Kennedy, B.W.2
  • 3
    • 33846217683 scopus 로고    scopus 로고
    • Benson S.J., Yinyu Y., DSDP5: Software for Semidefinite programming, ACM Trans. Math. Software (2005) http://www.stanford.edu/~yyye/DSDP5-Paper.pdf.
    • Benson S.J., Yinyu Y., DSDP5: Software for Semidefinite programming, ACM Trans. Math. Software (2005) http://www.stanford.edu/~yyye/DSDP5-Paper.pdf.
  • 4
    • 0033295981 scopus 로고    scopus 로고
    • A C library for semidefinite programming
    • Borchers B., CSDP, A C library for semidefinite programming, Optim. Methods Softw. 11 (1999) 613-623.
    • (1999) Optim. Methods Softw , vol.11 , pp. 613-623
    • Borchers, B.1    CSDP2
  • 6
    • 0000138073 scopus 로고
    • Balancing selection response and rate of inbreeding by including genetic-relationships in selection decisions
    • Brisbane J.R., Gibson J.P., Balancing selection response and rate of inbreeding by including genetic-relationships in selection decisions, Theor. Appl. Genet. 91 (1995) 421-431.
    • (1995) Theor. Appl. Genet , vol.91 , pp. 421-431
    • Brisbane, J.R.1    Gibson, J.P.2
  • 7
    • 3142637107 scopus 로고    scopus 로고
    • A method for the dynamic management of variability in dairy cattle
    • Colleau J.J., Moureaux S., Briend J.B., A method for the dynamic management of variability in dairy cattle, Genet. Sel. Evol. 36 (2004) 373-394.
    • (2004) Genet. Sel. Evol , vol.36 , pp. 373-394
    • Colleau, J.J.1    Moureaux, S.2    Briend, J.B.3
  • 8
    • 0031853913 scopus 로고    scopus 로고
    • Optimizing selection for quantitative traits with information on an identified locus in outbred populations
    • Dekkers J.C.M., van Arendonk J.A.M., Optimizing selection for quantitative traits with information on an identified locus in outbred populations, Genet. Res. Camb. 71 (1998) 257-275.
    • (1998) Genet. Res. Camb , vol.71 , pp. 257-275
    • Dekkers, J.C.M.1    van Arendonk, J.A.M.2
  • 9
    • 0001244316 scopus 로고
    • Marker assisted selection using best linear unbiased prediction
    • Fernando R.L., Grossman M., Marker assisted selection using best linear unbiased prediction, Genet. Sel. Evol. 21 (1989) 467-477.
    • (1989) Genet. Sel. Evol , vol.21 , pp. 467-477
    • Fernando, R.L.1    Grossman, M.2
  • 10
    • 33846200653 scopus 로고    scopus 로고
    • Fujisawa K., Kojima M., Nakata K., Yamashita M., SDPA (SemiDefinite Programming Algorithm) user's manual - version 6.00. Research Reports on Mathematical and Computer Sciences (2002) Series B: Operations Research.
    • Fujisawa K., Kojima M., Nakata K., Yamashita M., SDPA (SemiDefinite Programming Algorithm) user's manual - version 6.00. Research Reports on Mathematical and Computer Sciences (2002) Series B: Operations Research.
  • 11
    • 0031698856 scopus 로고    scopus 로고
    • Dynamic selection procedures for constrained inbreeding and their consequences for pedigree development
    • Grundy B., Villanueva B., Woolliams J.A., Dynamic selection procedures for constrained inbreeding and their consequences for pedigree development, Genet. Res., Camb. 72 (1998) 159-168.
    • (1998) Genet. Res., Camb , vol.72 , pp. 159-168
    • Grundy, B.1    Villanueva, B.2    Woolliams, J.A.3
  • 12
    • 51249181779 scopus 로고
    • A new polynomial-time algorithm for linear programming
    • Karmarkar N., A new polynomial-time algorithm for linear programming, Combinatorica 4 (1984) 373-395.
    • (1984) Combinatorica , vol.4 , pp. 373-395
    • Karmarkar, N.1
  • 15
    • 0031113935 scopus 로고    scopus 로고
    • Maximizing the response of selection with a predefined rate of inbreeding
    • Meuwissen T.H.E., Maximizing the response of selection with a predefined rate of inbreeding, J. Anim. Sci. 75 (1997) 934-940.
    • (1997) J. Anim. Sci , vol.75 , pp. 934-940
    • Meuwissen, T.H.E.1
  • 16
    • 0035045051 scopus 로고    scopus 로고
    • Prediction of genetic value using genome-wide dense marker maps
    • Meuwissen T.H.E., Hayes B.J., Goddard M.E., Prediction of genetic value using genome-wide dense marker maps, Genetics 157 (2001) 1819-1829.
    • (2001) Genetics , vol.157 , pp. 1819-1829
    • Meuwissen, T.H.E.1    Hayes, B.J.2    Goddard, M.E.3
  • 17
    • 33846223753 scopus 로고    scopus 로고
    • Nesterov Y., Nemirovsky A., A general approach to polynomial-time algorithms design for convex programming, Technical Report (1988) Centr. Econ. & Math. Inst., USSR Acad. Sci., Moscow, USSR.
    • Nesterov Y., Nemirovsky A., A general approach to polynomial-time algorithms design for convex programming, Technical Report (1988) Centr. Econ. & Math. Inst., USSR Acad. Sci., Moscow, USSR.
  • 18
    • 0003254248 scopus 로고
    • Interior-point polynomial methods in convex programming
    • SIAM, Philadelphia, PA
    • Nesterov Y., Nemirovsky A., Interior-point polynomial methods in convex programming, Studies in Applied Mathematics, Vol. 13. SIAM, Philadelphia, PA (1994).
    • (1994) Studies in Applied Mathematics , vol.13
    • Nesterov, Y.1    Nemirovsky, A.2
  • 19
    • 0031793451 scopus 로고    scopus 로고
    • Response to mass selection when an identified major gene is segregating
    • Pong-Wong R., Woolliams J.A., Response to mass selection when an identified major gene is segregating, Genet. Sel. Evol. 30 (1998) 313-337.
    • (1998) Genet. Sel. Evol , vol.30 , pp. 313-337
    • Pong-Wong, R.1    Woolliams, J.A.2
  • 20
    • 0030106462 scopus 로고    scopus 로고
    • Semidefinite programming
    • Vandenberghe L., Boyd S., Semidefinite programming, SIAM Review 38 (1996) 49-95.
    • (1996) SIAM Review , vol.38 , pp. 49-95
    • Vandenberghe, L.1    Boyd, S.2
  • 21
    • 0032937374 scopus 로고    scopus 로고
    • Potential benefit from using an identified major gene and BLUP estimated breeding values in selection programmes
    • Villanueva B., Pong-Wong R., Grundy B., Woolliams J.A., Potential benefit from using an identified major gene and BLUP estimated breeding values in selection programmes, Genet. Sel. Evol. 31 (1999) 115-133.
    • (1999) Genet. Sel. Evol , vol.31 , pp. 115-133
    • Villanueva, B.1    Pong-Wong, R.2    Grundy, B.3    Woolliams, J.A.4
  • 22
    • 0036869309 scopus 로고    scopus 로고
    • Marker assisted selection with optimized contributions of the candidates to selection
    • Villanueva B., Pong-Wong R., Woolliams J.A., Marker assisted selection with optimized contributions of the candidates to selection, Genet. Sel. Evol. 34 (2002) 679-703.
    • (2002) Genet. Sel. Evol , vol.34 , pp. 679-703
    • Villanueva, B.1    Pong-Wong, R.2    Woolliams, J.A.3
  • 23
    • 84971942289 scopus 로고
    • Modifications to MOET nucleus schemes to improve rates of genetic progress and decrease rates of inbreeding in diary-cattle
    • Woolliams J.A., Modifications to MOET nucleus schemes to improve rates of genetic progress and decrease rates of inbreeding in diary-cattle, Anim. Prod. 49 (1989) 1-14.
    • (1989) Anim. Prod , vol.49 , pp. 1-14
    • Woolliams, J.A.1
  • 24
    • 84971942267 scopus 로고
    • Decision rules and variance of response in breeding schemes
    • Woolliams J.A., Meuwissen T.H.E., Decision rules and variance of response in breeding schemes, Anim. Prod. 56 (1993) 179-186.
    • (1993) Anim. Prod , vol.56 , pp. 179-186
    • Woolliams, J.A.1    Meuwissen, T.H.E.2
  • 26
    • 33846245377 scopus 로고    scopus 로고
    • Woolliams J.A., Pong-Wong R., Villanueva B., Strategic optimisation of short- and long- term gain and inbreeding in MAS and non-MAS schemes, in: Proc. 7th World Congr. Genet. Appl. Livest. Prod. (2002) CD-ROM Communications 23-02.
    • Woolliams J.A., Pong-Wong R., Villanueva B., Strategic optimisation of short- and long- term gain and inbreeding in MAS and non-MAS schemes, in: Proc. 7th World Congr. Genet. Appl. Livest. Prod. (2002) CD-ROM Communications 23-02.
  • 27
    • 0027951123 scopus 로고
    • Increasing long-term response to selection
    • Wray N.R., Goddard M.E., Increasing long-term response to selection, Genet. Sel. Evol. 26 (1994) 431-451.
    • (1994) Genet. Sel. Evol , vol.26 , pp. 431-451
    • Wray, N.R.1    Goddard, M.E.2
  • 28
    • 0009635625 scopus 로고    scopus 로고
    • DPSOL: A parser/solver for semidefinite programs with matrix structure
    • El Ghaoui L, Niculescu S.I, Eds, SIAM
    • Wu S.P., Boyd S., DPSOL: A parser/solver for semidefinite programs with matrix structure, in: El Ghaoui L., Niculescu S.I. (Eds.), Advances in linear matrix inequality methods in control, SIAM, 2000, pp. 79-91.
    • (2000) Advances in linear matrix inequality methods in control , pp. 79-91
    • Wu, S.P.1    Boyd, S.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.