{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:40:35Z","timestamp":1725565235301},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642152931"},{"type":"electronic","value":"9783642152948"}],"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_27","type":"book-chapter","created":{"date-parts":[[2010,9,10]],"date-time":"2010-09-10T04:51:46Z","timestamp":1284094306000},"page":"325-336","source":"Crossref","is-referenced-by-count":9,"title":["Swiftly Computing Center Strings"],"prefix":"10.1007","author":[{"given":"Franziska","family":"Hufsky","sequence":"first","affiliation":[]},{"given":"L\u00e9on","family":"Kuchenbecker","sequence":"additional","affiliation":[]},{"given":"Katharina","family":"Jahn","sequence":"additional","affiliation":[]},{"given":"Jens","family":"Stoye","sequence":"additional","affiliation":[]},{"given":"Sebastian","family":"B\u00f6cker","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"8","key":"27_CR1","doi-asserted-by":"publisher","first-page":"1085","DOI":"10.1089\/cmb.2009.0098","volume":"16","author":"S. B\u00f6cker","year":"2009","unstructured":"B\u00f6cker, S., Jahn, K., Mixtacki, J., Stoye, J.: Computation of median gene clusters. J. Comput. Biol.\u00a016(8), 1085\u20131099 (2009)","journal-title":"J. Comput. Biol."},{"issue":"4","key":"27_CR2","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1109\/TCBB.2007.70241","volume":"4","author":"J. Davila","year":"2007","unstructured":"Davila, J., Balla, S., Rajasekaran, S.: Fast and practical algorithms for planted (l, d) motif search. IEEE\/ACM Trans. Comput. Biol. Bioinformatics\u00a04(4), 544\u2013552 (2007)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinformatics"},{"issue":"2","key":"27_CR3","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/BF02679443","volume":"30","author":"M. Frances","year":"1997","unstructured":"Frances, M., Litman, A.: On covering problems of codes. Theory Comput. Systems\u00a030(2), 113\u2013119 (1997)","journal-title":"Theory Comput. Systems"},{"issue":"1","key":"27_CR4","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(1), 25\u201342 (2003)","journal-title":"Algorithmica"},{"issue":"1","key":"27_CR5","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/S0890-5401(03)00057-9","volume":"185","author":"J.K. Lanctot","year":"2003","unstructured":"Lanctot, J.K., Li, M., Ma, B., Wang, S., Zhang, L.: Distinguishing string selection problems. Information and Computation\u00a0185(1), 41\u201355 (2003)","journal-title":"Information and Computation"},{"key":"27_CR6","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/11527503_70","volume-title":"Advanced Data Mining and Applications","author":"X. Liu","year":"2005","unstructured":"Liu, X., He, H., Sykora, O.: Parallel genetic algorithm and parallel simulated annealing algorithm for the closest string problem. In: Li, X., Wang, S., Dong, Z.Y. (eds.) ADMA 2005. LNCS (LNAI), vol.\u00a03584, pp. 591\u2013597. Springer, Heidelberg (2005)"},{"issue":"4","key":"27_CR7","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 J. Comput.\u00a039(4), 1432\u20131443 (2009)","journal-title":"SIAM J. Comput."},{"key":"27_CR8","doi-asserted-by":"crossref","unstructured":"Rahmann, S., Klau, G.W.: Integer linear programming techniques for discovering approximate gene clusters. In: Mandoiu, I., Zelikovsky, A. (eds.) Bioinformatics Algorithms: Techniques and Applications. Wiley Series on Bioinformatics: Computational Techniques and Engineering, ch.\u00a09, pp. 203\u2013222. Wiley, Chichester (2008)","DOI":"10.1002\/9780470253441.ch9"},{"key":"27_CR9","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)"},{"key":"27_CR10","doi-asserted-by":"crossref","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)","DOI":"10.1186\/1471-2105-7-S4-S9"},{"key":"27_CR11","doi-asserted-by":"crossref","unstructured":"Yanai, I., DeLisi, C.: The society of genes: networks of functional links between genes from comparative genomics. Genome Biol.\u00a03(11), research0064 (2002)","DOI":"10.1186\/gb-2002-3-11-research0064"}],"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_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,4]],"date-time":"2019-06-04T06:57:00Z","timestamp":1559631420000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15294-8_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642152931","9783642152948"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15294-8_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}