{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T13:59:01Z","timestamp":1725890341999},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642312649"},{"type":"electronic","value":"9783642312656"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31265-6_35","type":"book-chapter","created":{"date-parts":[[2012,6,11]],"date-time":"2012-06-11T23:28:23Z","timestamp":1339457303000},"page":"439-452","source":"Crossref","is-referenced-by-count":0,"title":["The Parameterized Complexity of the Shared Center Problem"],"prefix":"10.1007","author":[{"given":"Zhi-Zhong","family":"Chen","sequence":"first","affiliation":[]},{"given":"Lusheng","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Wenji","family":"Ma","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"5","key":"35_CR1","doi-asserted-by":"publisher","first-page":"1400","DOI":"10.1109\/TCBB.2011.21","volume":"8","author":"Z.-Z. Chen","year":"2011","unstructured":"Chen, Z.-Z., Wang, L.: Fast exact algorithms for the closest string and substring problems with application to the planted (L,d)-motif model. IEEE\/ACM Transactions on Computational Biology and Bioinformatics\u00a08(5), 1400\u20131410 (2011)","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics"},{"key":"35_CR2","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1016\/j.jcss.2011.01.003","volume":"78","author":"Z.-Z. Chen","year":"2012","unstructured":"Chen, Z.-Z., Ma, B., Wang, L.: A three-string approach to the closest string problem. Journal of Computer and System Sciences\u00a078, 164\u2013178 (2012)","journal-title":"Journal of Computer and System Sciences"},{"key":"35_CR3","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/978-3-540-39763-2_25","volume-title":"Algorithms in Bioinformatics","author":"K. Doi","year":"2003","unstructured":"Doi, K., Li, J., Jiang, T.: Minimum Recombinant Haplotype Configuration on Tree Pedigrees. In: Benson, G., Page, R.D.M. (eds.) WABI 2003. LNCS (LNBI), vol.\u00a02812, pp. 339\u2013353. Springer, Heidelberg (2003)"},{"key":"35_CR4","series-title":"Monogr. Comput. Sci","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Monogr. Comput. Sci. Springer, New York (1999)"},{"key":"35_CR5","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s00453-003-1028-3","volume":"37","author":"J. Gramm","year":"2003","unstructured":"Gramm, J., Niedermeier, R., Rossmanith, P.: Fixed-parameter algorithms for closest string and related problems. Algorithmica\u00a037, 25\u201342 (2003)","journal-title":"Algorithmica"},{"key":"35_CR6","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1006\/jcss.2001.1774","volume":"63","author":"R. Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity? J. Comput. System Sci.\u00a063, 512\u2013530 (2001)","journal-title":"J. Comput. System Sci."},{"key":"35_CR7","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1186\/1471-2156-6-7","volume":"6","author":"I. Leykin","year":"2005","unstructured":"Leykin, I., Hao, K., Cheng, J., Meyer, N., Pollak, M.R., Smith, R.J.H., Wong, W.H., Rosenow, C., Li, C.: Comparative linkage analysis and visualization of high-density oligonucleotide snp array data. BMC Genetics\u00a06, 7 (2005)","journal-title":"BMC Genetics"},{"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 Symposium on Computational Molecular Biology (RECOMB), pp. 20\u201329 (2004)","key":"35_CR8","DOI":"10.1145\/974614.974618"},{"issue":"6","key":"35_CR9","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. Journal of Computational Biology\u00a012(6), 719\u2013739 (2005)","journal-title":"Journal of Computational Biology"},{"key":"35_CR10","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1109\/TCBB.2011.134","volume":"9","author":"W. Ma","year":"2012","unstructured":"Ma, W., Yang, Y., Chen, Z.-Z., Wang, L.: Mutation region detection for closely related individuals without a known pedigree. IEEE\/ACM Transactions on Computational Biology and Bioinformatics\u00a09, 499\u2013510 (2012)","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics"},{"key":"35_CR11","doi-asserted-by":"publisher","first-page":"1432","DOI":"10.1137\/080739069","volume":"39","author":"B. Ma","year":"2009","unstructured":"Ma, B., Sun, X.: More efficient algorithms for closest string and substring problems. SIAM Journal on Computing\u00a039, 1432\u20131443 (2009)","journal-title":"SIAM Journal on Computing"},{"key":"35_CR12","doi-asserted-by":"publisher","first-page":"1382","DOI":"10.1137\/060673898","volume":"38","author":"D. Marx","year":"2008","unstructured":"Marx, D.: Closest substring problems with small distances. SIAM Journal on Computing\u00a038, 1382\u20131410 (2008)","journal-title":"SIAM Journal on Computing"},{"doi-asserted-by":"crossref","unstructured":"Sellick, G., Longman, C., Tolmie, J., Newbury-Ecob, R., Geenhalgh, L., Hughes, S., Whiteford, M., Carrett, C., Houlston, R.: Genomewide linkage searches for mendelian disease loci can be efficiently conducted using high-density snp genotyping arrays. Nucleic Acids Res\u00a032(20), e164 (2004)","key":"35_CR13","DOI":"10.1093\/nar\/gnh163"},{"key":"35_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/978-3-642-02270-8_27","volume-title":"Frontiers in Algorithmics","author":"L. Wang","year":"2009","unstructured":"Wang, L., Zhu, B.: Efficient Algorithms for the Closest String and Distinguishing String Selection Problems. In: Deng, X., Hopcroft, J.E., Xue, J. (eds.) FAW 2009. LNCS, vol.\u00a05598, pp. 261\u2013270. Springer, Heidelberg (2009)"},{"unstructured":"Xiao, J., Liu, L., Xia, L., Jiang, T.: Fast elimination of redundant linear equations and reconstruction of recombination-free mendelian inheritance on a pedigree. In: Proceedings of ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 655\u2013664 (2007)","key":"35_CR15"},{"unstructured":"Zhao, R., Zhang, N.: A more efficient closest string algorithm. In: Proceedings of the 2nd International Conference on Bioinformatics and Computational Biology (BICoB), pp. 210\u2013215 (2010)","key":"35_CR16"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31265-6_35.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T07:54:19Z","timestamp":1620114859000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31265-6_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642312649","9783642312656"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31265-6_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}