{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:04:17Z","timestamp":1725512657978},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540681540"},{"type":"electronic","value":"9783540681557"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-68155-7_28","type":"book-chapter","created":{"date-parts":[[2008,5,19]],"date-time":"2008-05-19T09:41:20Z","timestamp":1211190080000},"page":"308-312","source":"Crossref","is-referenced-by-count":7,"title":["Efficient Haplotype Inference with Combined CP and OR Techniques"],"prefix":"10.1007","author":[{"given":"Ana","family":"Gra\u00e7a","sequence":"first","affiliation":[]},{"given":"Jo\u00e3o","family":"Marques-Silva","sequence":"additional","affiliation":[]},{"given":"In\u00eas","family":"Lynce","sequence":"additional","affiliation":[]},{"given":"Arlindo L.","family":"Oliveira","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"28_CR1","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1109\/TCBB.2006.24","volume":"3","author":"D. Brown","year":"2006","unstructured":"Brown, D., Harrower, I.: Integer programming approaches to haplotype inference by pure parsimony. IEEE\/ACM Transactions on Computational Biology and Bioinformatics\u00a03(2), 141\u2013154 (2006)","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics"},{"key":"28_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/SAT190014","volume":"2","author":"N. E\u00e9n","year":"2006","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: Translating pseudo-Boolean constraints into SAT. Journal on Satisfiability, Boolean Modeling and Computation\u00a02, 1\u201326 (2006)","journal-title":"Journal on Satisfiability, Boolean Modeling and Computation"},{"key":"28_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-540-73433-8_10","volume-title":"Algebraic Biology","author":"A. Gra\u00e7a","year":"2007","unstructured":"Gra\u00e7a, A., Marques-Silva, J., Lynce, I., Oliveira, A.: Efficient haplotype inference with pseudo-Boolean optimization. In: Anai, H., Horimoto, K., Kutsia, T. (eds.) Ab 2007. LNCS, vol.\u00a04545, pp. 125\u2013139. Springer, Heidelberg (2007)"},{"key":"28_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/3-540-44888-8_11","volume-title":"Combinatorial Pattern Matching","author":"D. Gusfield","year":"2003","unstructured":"Gusfield, D.: Haplotype inference by pure parsimony. In: Baeza-Yates, R., Ch\u00e1vez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol.\u00a02676, pp. 144\u2013155. Springer, Heidelberg (2003)"},{"key":"28_CR5","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1287\/ijoc.1040.0085","volume":"16","author":"G. Lancia","year":"2004","unstructured":"Lancia, G., Pinotti, C., Rizzi, R.: Haplotyping populations by pure parsimony: complexity of exact and approximation algorithms. INFORMS Journal on Computing\u00a016, 348\u2013359 (2004)","journal-title":"INFORMS Journal on Computing"},{"key":"28_CR6","unstructured":"Lynce, I., Marques-Silva, J.: Efficient haplotype inference with Boolean satisfiability. In: National Conference on Artificial Intelligence (AAAI) (2006)"},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"Lynce, I., Marques-Silva, J., Prestwich, S.: Boosting haplotype inference with local search. Constraints\u00a013(1) (2008)","DOI":"10.1007\/s10601-007-9035-7"},{"issue":"14","key":"28_CR8","doi-asserted-by":"publisher","first-page":"1773","DOI":"10.1093\/bioinformatics\/btg239","volume":"19","author":"L. Wang","year":"2003","unstructured":"Wang, L., Xu, Y.: Haplotype inference by maximum parsimony. Bioinformatics\u00a019(14), 1773\u20131780 (2003)","journal-title":"Bioinformatics"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-68155-7_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:09:07Z","timestamp":1605762547000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68155-7_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540681540","9783540681557"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68155-7_28","relation":{},"subject":[]}}