{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:09:26Z","timestamp":1725566966345},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540304951"},{"type":"electronic","value":"9783540324195"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11590156_38","type":"book-chapter","created":{"date-parts":[[2005,12,5]],"date-time":"2005-12-05T15:43:16Z","timestamp":1133797396000},"page":"470-482","source":"Crossref","is-referenced-by-count":0,"title":["On Counting the Number of Consistent Genotype Assignments for Pedigrees"],"prefix":"10.1007","author":[{"given":"Ji\u0159\u00ed","family":"Srba","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"38_CR1","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/BF02944784","volume":"19","author":"L. Aceto","year":"2004","unstructured":"Aceto, L., Hansen, J.A., Ing\u00f3lfsd\u00f3ttir, A., Johnsen, J., Knudsen, J.: The complexity of checking consistency of pedigree information and related problems. J. of Computer Science and Technology\u00a019(1), 42\u201359 (2004)","journal-title":"J. of Computer Science and Technology"},{"key":"38_CR2","doi-asserted-by":"crossref","first-page":"2051","DOI":"10.1093\/genetics\/156.4.2051","volume":"156","author":"F.X. Dua","year":"2000","unstructured":"Dua, F.X., Hoeschele, I.: A note on algorithms for genotype and allele elimination in complex pedigrees with incomplete genotype data. Genetics\u00a0156, 2051\u20132062 (2000)","journal-title":"Genetics"},{"issue":"4","key":"38_CR3","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1137\/0212053","volume":"12","author":"M.O. Ball","year":"1983","unstructured":"Ball, M.O., Provan, J.S.: The complexity of counting cuts and of computing the probability that a graph is connected. SIAM J. on Comp.\u00a012(4), 777\u2013788 (1983)","journal-title":"SIAM J. on Comp."},{"issue":"2","key":"38_CR4","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1159\/000152714","volume":"25","author":"K. Lange","year":"1975","unstructured":"Lange, K., Elston, R.C.: Extensions to pedigree analysis i. likehood calculations for simple and complex pedigrees. Human Heredity\u00a025(2), 95\u2013105 (1975)","journal-title":"Human Heredity"},{"key":"38_CR5","volume-title":"Concepts of Genetics","author":"W.S. Klug","year":"1997","unstructured":"Klug, W.S., Cummings, M.R.: Concepts of Genetics, 5th edn. Prentice Hall, Englewood Cliffs (1997)","edition":"5"},{"key":"38_CR6","first-page":"250","volume":"40","author":"K. Lange","year":"1987","unstructured":"Lange, K., Goradia, T.: An algorithm for automatic genotype elimination. American J. of Human Genetics\u00a040, 250\u2013256 (1987)","journal-title":"American J. of Human Genetics"},{"key":"38_CR7","first-page":"250","volume":"40","author":"K. Lange","year":"1987","unstructured":"Lange, K., Goradia, T.M.: An algorithm for automatic genotype elimination. American J. of Human Genetics\u00a040, 250\u2013256 (1987)","journal-title":"American J. of Human Genetics"},{"key":"38_CR8","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1145\/640075.640101","volume-title":"Proceedings of RECOMB 2003","author":"J. Li","year":"2003","unstructured":"Li, J., Jiang, T.: Efficient rule-based haplotyping algorithms for pedigree data. In: Proceedings of RECOMB 2003, pp. 197\u2013206. ACM, New York (2003)"},{"key":"38_CR9","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1086\/301904","volume":"63","author":"J.R. O\u2019Connell","year":"1998","unstructured":"O\u2019Connell, J.R., Weeks, D.E.: Pedcheck: A program for identification of genotype incompatibilities in linkage analysis. Am. J. of Human Genetics\u00a063, 259\u2013266 (1998)","journal-title":"Am. J. of Human Genetics"},{"key":"38_CR10","doi-asserted-by":"publisher","first-page":"1733","DOI":"10.1086\/302663","volume":"65","author":"J.R. O\u2019Connell","year":"1999","unstructured":"O\u2019Connell, J.R., Weeks, D.E.: An optimal algorithm for automatic genotype elimination. American J. of Human Genetics\u00a065, 1733\u20131740 (1999)","journal-title":"American J. of Human Genetics"},{"key":"38_CR11","volume-title":"Computational Complexity","author":"C..H. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)"},{"issue":"5","key":"38_CR12","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1089\/106652703322539088","volume":"10","author":"A. Piccolboni","year":"2003","unstructured":"Piccolboni, A., Gusfield, D.: On the complexity of fundamental computational problems in pedigree analysis. J. of Computational Biology\u00a010(5), 763\u2013773 (2003)","journal-title":"J. of Computational Biology"}],"container-title":["Lecture Notes in Computer Science","FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11590156_38.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,21]],"date-time":"2021-07-21T00:49:00Z","timestamp":1626828540000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11590156_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540304951","9783540324195"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11590156_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}