Abstract
In the crossing schedule optimization problem we are given an initial set of parental genotypes and a desired genotype, the ideotype. The task is to schedule crossings of individuals such that the number of generations, the number of crossings, and the required populations size are minimized. We present for the first time a mathematical model for the general problem variant and show that the problem is \(\mathcal{NP}\)-hard and even hard to approximate. On the positive side, we present a mixed integer programming formulation that exploits the intrinsic combinatorial structure of the problem. We are able to solve a real-world instance to provable optimality in less than 2 seconds, which was not possible with earlier methods.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bradley, S.P., Hax, A.C., Magnanti, T.L.: Applied Mathematical Programming. Addison-Wesley, Reading (1977)
Brown, J., Caligari, P.: Introduction to Plant Breeding. Wiley-Blackwell (2008)
Collard, B.C.Y., Mackill, D.J.: Marker-assisted selection: an approach for precision plant breeding in the twenty-first century. Phil. Trans. R. Soc. B 363(1491), 557–572 (2008)
Dekkers, J.C.M., Hospital, F.: The use of molecular genetics in the improvement of agricultural populations. Nature Reviews Genetics 3, 22–32 (2002)
Haldane, J.B.S.: The combination of linkage values and the calculation of distances between the loci of linked factors. Journal of Genetics 8, 299–309 (1919)
Ishii, T., Yonezawa, K.: Optimization of the marker-based procedures for pyramiding genes from multiple donor lines: I. Schedule of crossing between the donor lines. Crop Science 47, 537–546 (2007)
Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85–103. Plenum Press, New York (1972)
Moose, S.P., Mumm, R.H.: Molecular plant breeding as the foundation for 21st century crop improvement. Plant Physiology 147, 969–977 (2008)
Raz, R., Safra, S.: A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP. In: Proc. 29th ACM Symp. on Theory of Computing, pp. 475–484 (1997)
Servin, B., Martin, O.C., Mézard, M., Hospital, F.: Toward a theory of marker-assisted gene pyramiding. Genetics 168(1), 513–523 (2004)
Shifriss, C., Pilowsky, M., Zacks, J.M.: Resistance to Leveillula Taurica mildew (=Oidiopsis taurica) in Capsicum annuum. Phytoparasitica 20(4), 279–283 (1992)
Steuer, R.E.: Multiple Criteria Optimization: Theory, Computation and Application. Krieger Pub. Co. (1986)
Wolsey, L.A.: Integer programming. Wiley-Interscience series in discrete mathematics and optimization. Wiley, Chichester (1998)
Ye, G., Smith, K.F.: Marker-assisted gene pyramiding for inbred line development: Basic principles and practical guidelines. International Journal of Plant Breeding 2(1), 1–10 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Canzar, S., El-Kebir, M. (2011). A Mathematical Programming Approach to Marker-Assisted Gene Pyramiding. In: Przytycka, T.M., Sagot, MF. (eds) Algorithms in Bioinformatics. WABI 2011. Lecture Notes in Computer Science(), vol 6833. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23038-7_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-23038-7_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23037-0
Online ISBN: 978-3-642-23038-7
eBook Packages: Computer ScienceComputer Science (R0)