{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T16:11:03Z","timestamp":1746115863093,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387678"},{"type":"electronic","value":"9783642387685"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38768-5_35","type":"book-chapter","created":{"date-parts":[[2013,5,17]],"date-time":"2013-05-17T04:31:28Z","timestamp":1368765088000},"page":"385-396","source":"Crossref","is-referenced-by-count":0,"title":["A Polynomial Time Approximation Scheme for the Closest Shared Center Problem"],"prefix":"10.1007","author":[{"given":"Weidong","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lusheng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenjuan","family":"Cui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"35_CR1","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1038\/ng786","volume":"30","author":"G. Abecasis","year":"2002","unstructured":"Abecasis, G., Cherny, S., Cookson, W., Cardon, L.: Merlin-rapid analysis of dense genetic maps using sparse gene flow trees. Nature Genetics\u00a030, 97\u2013101 (2002)","journal-title":"Nature Genetics"},{"key":"35_CR2","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1186\/1471-2105-10-115","volume":"10","author":"Z. Cai","year":"2009","unstructured":"Cai, Z., Sabaa, H., Wang, Y., Goebel, R., Wang, Z., Xu, J., Stothard, P., Lin, G.: Most parsimonious haplotype allele sharing determination. BMC Bioinformatics\u00a010, 115 (2009)","journal-title":"BMC Bioinformatics"},{"key":"35_CR3","doi-asserted-by":"crossref","unstructured":"Gillman, D.: A Chernoff bound for randomwalks on expanders. In: Proceedings of the 34th Annual Symposium on Foundations of Computer Science, pp. 680\u2013691 (1993)","DOI":"10.1109\/SFCS.1993.366819"},{"key":"35_CR4","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1038\/75514","volume":"25","author":"D.F. Gudbjartsson","year":"2000","unstructured":"Gudbjartsson, D.F., Jonasson, K., Frigge, M.L., Kong, A.: Allegro, a new computer program for multipoint linkage analysis. Nature Genetics\u00a025, 12\u201313 (2000)","journal-title":"Nature Genetics"},{"key":"35_CR5","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N. Karmarkar","year":"1984","unstructured":"Karmarkar, N.: A new polynomial-time algorithm for linear programming. Combinatorica\u00a04, 373\u2013395 (1984)","journal-title":"Combinatorica"},{"key":"35_CR6","first-page":"1347","volume":"58","author":"L. Kruglyak","year":"1995","unstructured":"Kruglyak, L., Daly, M.J., Reeve-Daly, M.P., Lander, E.S.: Parametric and nonparametric linkage analysis: a unified multipoint approach. American Journal of Human Genetics\u00a058, 1347\u20131363 (1995)","journal-title":"American Journal of Human Genetics"},{"key":"35_CR7","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1145\/506147.506150","volume":"49","author":"M. Li","year":"2002","unstructured":"Li, M., Ma, B., Wang, L.: On the closest string and substring problems. J. Assoc. Comput. Mach.\u00a049, 157\u2013171 (2002)","journal-title":"J. Assoc. Comput. Mach."},{"issue":"1","key":"35_CR8","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1093\/bioinformatics\/btm552","volume":"24","author":"G. Lin","year":"2008","unstructured":"Lin, G., Wang, Z., Wang, L., Lau, Y.-L., Yang, W.: Identification of linked regions using high-density SNP genotype data in linkage analysis. Bioinformatics\u00a024(1), 86\u201393 (2008)","journal-title":"Bioinformatics"},{"issue":"2","key":"35_CR9","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1109\/TCBB.2011.134","volume":"9","author":"W. Ma","year":"2012","unstructured":"Ma, W., Yang, Y., Chen, Z., Wang, L.: Mutation region detection for closely related individuals without a known pedigree using high-density genotype data. IEEE\/ACM Transactions on Computational Biology and Bioinformatics\u00a09(2), 372\u2013384 (2012)","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics"},{"key":"35_CR10","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1186\/1471-2105-13-146","volume":"13","author":"W. Cui","year":"2012","unstructured":"Cui, W., Wang, L.: Identifying mutation regions for closely related individuals without a known pedigree. BMC Bioinformatics\u00a013, 146 (2012)","journal-title":"BMC Bioinformatics"},{"key":"35_CR11","unstructured":"Chen, Z.-Z., Ma, W., Wang, L.: The Parameterized Complexity of the Shared Center Problem, Algorithmic (to appear)"},{"key":"35_CR12","doi-asserted-by":"crossref","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge Univ. Press (1995)","DOI":"10.1017\/CBO9780511814075"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38768-5_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T10:26:26Z","timestamp":1746008786000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38768-5_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642387678","9783642387685"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38768-5_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}