{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T23:24:14Z","timestamp":1773271454815,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642152931","type":"print"},{"value":"9783642152948","type":"electronic"}],"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_11","type":"book-chapter","created":{"date-parts":[[2010,9,10]],"date-time":"2010-09-10T04:51:46Z","timestamp":1284094306000},"page":"124-135","source":"Crossref","is-referenced-by-count":3,"title":["Fixed-Parameter Algorithm for Haplotype Inferences on General Pedigrees with Small Number of Sites"],"prefix":"10.1007","author":[{"given":"Duong D.","family":"Doan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Patricia A.","family":"Evans","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/11851561_6","volume-title":"Algorithms in Bioinformatics","author":"B.M.-Y. Chan","year":"2006","unstructured":"Chan, B.M.-Y., et al.: Linear-time haplotype inference on pedigrees without recombinations. In: B\u00fccher, P., Moret, B.M.E. (eds.) WABI 2006. LNCS (LNBI), vol.\u00a04175, pp. 56\u201367. Springer, Heidelberg (2006)"},{"key":"11_CR2","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, McGraw-Hill (2001)"},{"key":"11_CR3","unstructured":"Doan, D.D., Evans, P.A., Horton, J.D.: A Near-Linear Time Algorithm for Haplotype Determination on General Pedigrees. Submitted to Journal of Computational Biology (2009) (Submission ID: JCB-2009-0133)"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Doan, D.D., Evans, P.A.: Fixed-Parameter Algorithm for General Pedigrees with a Single Pair of Sites. In: Borodovsky, M., Gogarten, J.P., Przytycka, T.M., Rajasekaran, S. (eds.) ISBRA 2010. LNCS, vol.\u00a06053, pp. 29\u201337. Springer, Heidelberg (2010)","DOI":"10.1007\/978-3-642-13078-6_5"},{"issue":"8","key":"11_CR5","doi-asserted-by":"publisher","first-page":"1386","DOI":"10.1016\/j.jcss.2006.02.001","volume":"72","author":"J. Guo","year":"2006","unstructured":"Guo, J., et al.: Compression-Based Fixed-Parameter Algorithms for Feedback Vertex Set and Edge Bipartization. Journal of Computer and System Sciences\u00a072(8), 1386\u20131396 (2006)","journal-title":"Journal of Computer and System Sciences"},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R.M. Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility Among Combinatorial Problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Plenum, New York (1972)"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Li, J., Jiang, T.: An exact solution for finding minimum recombinant haplotype configurations on pedigrees with missing data by integer linear programming. In: Proceedings of Research in Computational Molecular Biology, pp. 20\u201329 (2004)","DOI":"10.1145\/974614.974618"},{"key":"11_CR8","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1016\/j.tcs.2007.02.036","volume":"378","author":"L. Liu","year":"2007","unstructured":"Liu, L., Chen, X., Xiao, J., Jiang, T.: Complexity and approximation of the minimum recombinant haplotype configuration problem. Theoretical Computer Science\u00a0378, 316\u2013330 (2007)","journal-title":"Theoretical Computer Science"},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1007\/BFb0120902","volume":"13","author":"J. Picard","year":"1980","unstructured":"Picard, J., Queyranne, M.: On the structure of all minimum cuts in a network and applications. Mathematical Programming Study\u00a013, 8\u201316 (1980)","journal-title":"Mathematical Programming Study"},{"key":"11_CR10","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to Fixed-Parameter Algorithms","author":"R. Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)"},{"issue":"6","key":"11_CR11","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 Journal of Human Genetics\u00a070(6), 1434\u20131445 (2002)","journal-title":"American Journal of Human Genetics"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Xiao, J., Lou, T., Jiang, T.: An efficient algorithm for haplotype inference on pedigrees with a small number of recombinants. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol.\u00a05757, pp. 325\u2013336. Springer, Heidelberg (2009)","DOI":"10.1007\/978-3-642-04128-0_30"},{"key":"11_CR13","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1016\/S0377-2217(97)00196-3","volume":"109","author":"S. Xu","year":"1998","unstructured":"Xu, S.: The line index and minimum cut of weighted graphs. European Journal of Operational Research\u00a0109, 672\u2013682 (1998)","journal-title":"European Journal of Operational Research"}],"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_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,4]],"date-time":"2019-06-04T06:57:25Z","timestamp":1559631445000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15294-8_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642152931","9783642152948"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15294-8_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}