{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:53:24Z","timestamp":1725558804862},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642140303"},{"type":"electronic","value":"9783642140310"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14031-0_48","type":"book-chapter","created":{"date-parts":[[2010,6,28]],"date-time":"2010-06-28T05:50:06Z","timestamp":1277704206000},"page":"449-458","source":"Crossref","is-referenced-by-count":2,"title":["A Three-String Approach to the Closest String Problem"],"prefix":"10.1007","author":[{"given":"Zhi-Zhong","family":"Chen","sequence":"first","affiliation":[]},{"given":"Bin","family":"Ma","sequence":"additional","affiliation":[]},{"given":"Lusheng","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"48_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/3-540-63220-4_63","volume-title":"Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching","author":"A. Ben-Dor","year":"1997","unstructured":"Ben-Dor, A., Lancia, G., Perone, J., Ravi, R.: Banishing bias from consensus sequences. In: Hein, J., Apostolico, A. (eds.) CPM 1997. LNCS, vol.\u00a01264, pp. 247\u2013261. Springer, Heidelberg (1997)"},{"key":"48_CR2","unstructured":"Chen, Z.Z., Wang, L.: Article 3A fast exact algorithm for the closest substring problem and its application to the planted (l,d)-motif model. In: TCBB (2009) (submitted for publication)"},{"issue":"4","key":"48_CR3","doi-asserted-by":"publisher","first-page":"1073","DOI":"10.1137\/S0097539701397825","volume":"32","author":"X. Deng","year":"2003","unstructured":"Deng, X., Li, G., Li, Z., Ma, B., Wang, L.: Genetic design of drugs without side-effects. SIAM Journal on Computing\u00a032(4), 1073\u20131090 (2003)","journal-title":"SIAM Journal on Computing"},{"key":"48_CR4","first-page":"123","volume":"9","author":"J. Dopazo","year":"1993","unstructured":"Dopazo, J., Rodr\u00edguez, A., S\u00e1iz, J.C., Sobrino, F.: Design of primers for PCR amplification of highly variable genomes. CABIOS\u00a09, 123\u2013125 (1993)","journal-title":"CABIOS"},{"key":"48_CR5","series-title":"Monographs in Computer Science","doi-asserted-by":"crossref","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. Monographs in Computer Science. Springer, New York (1999)"},{"key":"48_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/978-3-540-45077-1_20","volume-title":"Fundamentals of Computation Theory","author":"P.A. Evans","year":"2003","unstructured":"Evans, P.A., Smith, A.D.: Complexity of approximating closest substring problems. In: Lingas, A., Nilsson, B.J. (eds.) FCT 2003. LNCS, vol.\u00a02751, pp. 210\u2013221. Springer, Heidelberg (2003)"},{"issue":"2","key":"48_CR7","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s00493-006-0011-4","volume":"26","author":"M.R. Fellows","year":"2006","unstructured":"Fellows, M.R., Gramm, J., Niedermeier, R.: On the parameterized intractability of motif search problems. Combinatorica\u00a026(2), 141\u2013167 (2006)","journal-title":"Combinatorica"},{"key":"48_CR8","first-page":"113","volume":"30","author":"M. Frances","year":"1997","unstructured":"Frances, M., Litman, A.: On covering problems of codes. Theoretical Computer Science\u00a030, 113\u2013119 (1997)","journal-title":"Theoretical Computer Science"},{"key":"48_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-540-45077-1_19","volume-title":"Fundamentals of Computation Theory","author":"J. Gramm","year":"2003","unstructured":"Gramm, J., Guo, J., Niedermeier, R.: On exact and approximation algorithms for distinguishing substring selection. In: Lingas, A., Nilsson, B.J. (eds.) FCT 2003. LNCS, vol.\u00a02751, pp. 159\u2013209. Springer, Heidelberg (2003)"},{"key":"48_CR10","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":"48_CR11","unstructured":"Lanctot, K., Li, M., Ma, B., Wang, S., Zhang, L.: Distinguishing string search problems. In: SODA 1999, pp. 633\u2013642 (1999)"},{"issue":"2","key":"48_CR12","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. Journal of the ACM\u00a049(2), 157\u2013171 (2002)","journal-title":"Journal of the ACM"},{"key":"48_CR13","doi-asserted-by":"crossref","unstructured":"Ma, B., Sun, X.: More efficient algorithms for closest string and substring problems. In: RECOMB 2008, pp. 396\u2013409 (2008)","DOI":"10.1007\/978-3-540-78839-3_33"},{"key":"48_CR14","doi-asserted-by":"crossref","unstructured":"Marx, D.: The closest substring problem with small distances. In: FOCS 2005, pp. 63\u201372 (2005)","DOI":"10.1109\/SFCS.2005.70"},{"key":"48_CR15","doi-asserted-by":"crossref","unstructured":"Meneses, C.N., Lu, Z., Oliveira, C.A.S., Pardalos, P.M.: Optimal solutions for the closest-string problem via integer programming. INFORMS Journal on Computing (2004)","DOI":"10.1287\/ijoc.1040.0090"},{"key":"48_CR16","doi-asserted-by":"crossref","unstructured":"Nicolas, F., Rivals, E.: Complexities of the centre and median string problems. In: Proceedings of the 14th Annual Symposium on Combinatorial Pattern Matching, pp. 315\u2013327 (2003)","DOI":"10.1007\/3-540-44888-8_23"},{"key":"48_CR17","doi-asserted-by":"crossref","unstructured":"Stojanovic, N., Berman, P., Gumucio, D., Hardison, R., Miller, W.: A linear-time algorithm for the 1-mismatch problem. In: Proceedings of the 5th International Workshop on Algorithms and Data Structures, pp. 126\u2013135 (1997)","DOI":"10.1007\/3-540-63307-3_53"},{"issue":"5","key":"48_CR18","doi-asserted-by":"publisher","first-page":"1039","DOI":"10.1142\/S0219720005001508","volume":"3","author":"L. Wang","year":"2005","unstructured":"Wang, L., Dong, L.: Randomized algorithms for motif detection. Journal of Bioinformatics and Computational Biology\u00a03(5), 1039\u20131052 (2005)","journal-title":"Journal of Bioinformatics and Computational Biology"},{"key":"48_CR19","doi-asserted-by":"crossref","unstructured":"Wang, L., Zhu, B.: Efficient algorithms for the closest string and distinguishing string selection problems. In: The Third International Frontiers of Algorithmics Workshop, pp. 261\u2013270 (2009)","DOI":"10.1007\/978-3-642-02270-8_27"},{"issue":"Suppl 4","key":"48_CR20","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1186\/1471-2105-7-S4-S9","volume":"7","author":"Y. Wang","year":"2006","unstructured":"Wang, Y., Chen, W., Li, X., Cheng, B.: Degenerated primer design to amplify the heavy chain variable region from immunoglobulin cDNA. BMC Bioinformatics\u00a07(Suppl. 4), S9 (2006)","journal-title":"BMC Bioinformatics"},{"key":"48_CR21","unstructured":"Zhao, R., Zhang, N.: A more efficient closest string algorithm. In: 2nd International Conference on Bioinformatics and Computational Biology (to appear, 2010)"}],"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-14031-0_48.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T08:16:35Z","timestamp":1619770595000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14031-0_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642140303","9783642140310"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14031-0_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}