{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:40:25Z","timestamp":1725565225036},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642152931"},{"type":"electronic","value":"9783642152948"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15294-8_13","type":"book-chapter","created":{"date-parts":[[2010,9,10]],"date-time":"2010-09-10T04:51:46Z","timestamp":1284094306000},"page":"148-161","source":"Crossref","is-referenced-by-count":0,"title":["Haplotype Inference on Pedigrees with Recombinations and Mutations"],"prefix":"10.1007","author":[{"given":"Yuri","family":"Pirola","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paola","family":"Bonizzoni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tao","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"13_CR1","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1006\/jcss.1997.1472","volume":"54","author":"S. Arora","year":"1997","unstructured":"Arora, S., Babai, L., Stern, J., Sweedyk, Z.: The hardness of approximate optima in lattices, codes, and systems of linear equations. J.\u00a0of Computer and System Sciences\u00a054(2), 317\u2013331 (1997)","journal-title":"J.\u00a0of Computer and System Sciences"},{"key":"13_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-58412-1","volume-title":"Complexity and Approximation: Combinatorial optimization problems and their approximability properties","author":"G. Ausiello","year":"1999","unstructured":"Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation: Combinatorial optimization problems and their approximability properties. Springer, Heidelberg (1999)"},{"issue":"6","key":"13_CR3","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1007\/BF02945456","volume":"18","author":"P. Bonizzoni","year":"2003","unstructured":"Bonizzoni, P., Della Vedova, G., Dondi, R., Li, J.: The haplotyping problem: An overview of computational models and solutions. J.\u00a0of Computer Science and Technology\u00a018(6), 675\u2013688 (2003)","journal-title":"J.\u00a0of Computer Science and Technology"},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1159\/000152448","volume":"21","author":"R.C. Elson","year":"1971","unstructured":"Elson, R.C., Stewart, J.: A general model for the analysis of pedigree data. Human Heredity\u00a021, 523\u2013542 (1971)","journal-title":"Human Heredity"},{"issue":"5576","key":"13_CR5","doi-asserted-by":"publisher","first-page":"2225","DOI":"10.1126\/science.1069424","volume":"296","author":"S.B. Gabriel","year":"2002","unstructured":"Gabriel, S.B., Schaffner, S.F., Nguyen, H., Moore, J.M., et al.: The structure of haplotype blocks in the human genome. Science\u00a0296(5576), 2225\u20132229 (2002)","journal-title":"Science"},{"key":"13_CR6","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","volume-title":"Low-Density Parity-Check Codes","author":"R.G. Gallager","year":"1963","unstructured":"Gallager, R.G.: Low-Density Parity-Check Codes. MIT Press, Cambridge (1963)"},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"2363","DOI":"10.1073\/pnas.84.8.2363","volume":"84","author":"E. Lander","year":"1987","unstructured":"Lander, E., Green, P.: Construction of multilocus genetic linkage maps in human. Proceedings of the National Academy of Sciences USA\u00a084, 2363\u20132367 (1987)","journal-title":"Proceedings of the National Academy of Sciences USA"},{"issue":"2","key":"13_CR8","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1159\/000088914","volume":"60","author":"S.M. Leal","year":"2005","unstructured":"Leal, S.M., Yan, K., M\u00fcller-Myhsok, B.: SimPed: a simulation program to generate haplotype and genotype data for pedigree structures. Human heredity\u00a060(2), 119\u2013122 (2005)","journal-title":"Human heredity"},{"issue":"1","key":"13_CR9","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1142\/S0219720003000204","volume":"1","author":"J. Li","year":"2003","unstructured":"Li, J., Jiang, T.: Efficient inference of haplotypes from genotypes on a pedigree. J.\u00a0of Bioinformatics and Computational Biology\u00a01(1), 41\u201369 (2003)","journal-title":"J.\u00a0of Bioinformatics and Computational Biology"},{"issue":"6","key":"13_CR10","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1089\/cmb.2005.12.719","volume":"12","author":"J. Li","year":"2005","unstructured":"Li, J., Jiang, T.: Computing the minimum recombinant haplotype configuration from incomplete genotype data on a pedigree by integer linear programming. J.\u00a0of Computational Biology\u00a012(6), 719\u2013739 (2005)","journal-title":"J.\u00a0of Computational Biology"},{"key":"13_CR11","unstructured":"Pearl, J.: Reverend Bayes on inference engines: A distributed hierarchical approach. In: Proc.\u00a0of the American Ass. of Artificial Intelligence National Conference on AI, Pittsburgh, PA, pp. 133\u2013136 (1982)"},{"issue":"6","key":"13_CR12","doi-asserted-by":"publisher","first-page":"1434","DOI":"10.1086\/340610","volume":"70","author":"D. Qian","year":"2002","unstructured":"Qian, D., Beckmann, L.: Minimum-recombinant haplotyping in pedigrees. American J.\u00a0of Human Genetics\u00a070(6), 1434\u20131445 (2002)","journal-title":"American J.\u00a0of Human Genetics"},{"issue":"6","key":"13_CR13","first-page":"1323","volume":"58","author":"E. Sobel","year":"1996","unstructured":"Sobel, E., Lange, K.: Descent graphs in pedigree analysis: applications to haplotyping, location scores, and marker-sharing statistics. American J.\u00a0of Human Genetics\u00a058(6), 1323\u20131337 (1996)","journal-title":"American J.\u00a0of Human Genetics"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"The International HapMap Consortium: A second generation human haplotype map of over 3.1 million SNPs. Nature\u00a0449(7164), 851\u2013861 (2007)","DOI":"10.1038\/nature06258"},{"issue":"3","key":"13_CR15","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1038\/ng.314","volume":"41","author":"D.A. Tr\u00e9gou\u00ebt","year":"2009","unstructured":"Tr\u00e9gou\u00ebt, D.A., K\u00f6nig, I.R., Erdmann, J., et al.: Genome-wide haplotype association study identifies the SLC22A3-LPAL2-LPA gene cluster as a risk locus for coronary artery disease. Nature genetics\u00a041(3), 283\u2013285 (2009)","journal-title":"Nature genetics"},{"key":"13_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/978-3-642-02441-2_31","volume-title":"Combinatorial Pattern Matching","author":"W.B. Wang","year":"2009","unstructured":"Wang, W.B., Jiang, T.: Efficient inference of haplotypes from genotypes on a pedigree with mutations and missing alleles (extented abstract). In: Kucherov, G., Ukkonen, E. (eds.) CPM 2009. LNCS, vol.\u00a05577, pp. 353\u2013367. Springer, Heidelberg (2009)"},{"issue":"6","key":"13_CR17","doi-asserted-by":"publisher","first-page":"2198","DOI":"10.1137\/070687591","volume":"38","author":"J. Xiao","year":"2009","unstructured":"Xiao, J., Liu, L., Xia, L., Jiang, T.: Efficient algorithms for reconstructing zero-recombinant haplotypes on a pedigree based on fast elimination of redundant linear equations. SIAM J.\u00a0on Computing\u00a038(6), 2198\u20132219 (2009)","journal-title":"SIAM J.\u00a0on Computing"}],"container-title":["Lecture Notes in Computer Science","Algorithms in Bioinformatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15294-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,4]],"date-time":"2019-06-04T06:56:56Z","timestamp":1559631416000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15294-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642152931","9783642152948"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15294-8_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}