{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,7]],"date-time":"2024-04-07T00:03:03Z","timestamp":1712448183499},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,4,19]],"date-time":"2011-04-19T00:00:00Z","timestamp":1303171200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/2.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["BMC Bioinformatics"],"published-print":{"date-parts":[[2011,12]]},"DOI":"10.1186\/1471-2105-12-106","type":"journal-article","created":{"date-parts":[[2011,4,23]],"date-time":"2011-04-23T06:16:10Z","timestamp":1303539370000},"source":"Crossref","is-referenced-by-count":4,"title":["Swiftly Computing Center Strings"],"prefix":"10.1186","volume":"12","author":[{"given":"Franziska","family":"Hufsky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L\u00e9on","family":"Kuchenbecker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Katharina","family":"Jahn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jens","family":"Stoye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebastian","family":"B\u00f6cker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,4,19]]},"reference":[{"key":"4503_CR1","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/S0890-5401(03)00057-9","volume":"185","author":"JK Lanctot","year":"2003","unstructured":"Lanctot JK, Li M, Ma B, Wang S, Zhang L: Distinguishing string selection problems. Information and Computation 2003, 185: 41\u201355. [ http:\/\/www.sciencedirect.com\/science\/article\/B6WGK-48D37KJ-3\/2\/219c09ad466c21ba5d31e8f20793ce48 ] 10.1016\/S0890-5401(03)00057-9","journal-title":"Information and Computation"},{"key":"4503_CR2","first-page":"261","volume-title":"Proc. of Frontiers in Algorithmics Workshop (FAW 2009), Volume 5598 of Lect. Notes Comput. Sc., Springer","author":"L Wang","year":"2009","unstructured":"Wang L, Zhu B: Effective Algorithms for the Closest String and Distinguishing String Selection Problems. Proc. of Frontiers in Algorithmics Workshop (FAW 2009), Volume 5598 of Lect. Notes Comput. Sc., Springer 2009, 261\u2013270. [ http:\/\/www.springerlink.com\/content\/k2086p4131001276\/ ]"},{"issue":"Suppl 4","key":"4503_CR3","doi-asserted-by":"publisher","first-page":"S9","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 2006, 7(Suppl 4):S9. 10.1186\/1471-2105-7-S4-S9","journal-title":"BMC Bioinformatics"},{"issue":"4","key":"4503_CR4","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 2007, 4(4):544\u2013552.","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinformatics"},{"issue":"11","key":"4503_CR5","doi-asserted-by":"publisher","first-page":"research0064","DOI":"10.1186\/gb-2002-3-11-research0064","volume":"3","author":"I Yanai","year":"2002","unstructured":"Yanai I, DeLisi C: The society of genes: networks of functional links between genes from comparative genomics. Genome Biol 2002, 3(11):research0064.","journal-title":"Genome Biol"},{"key":"4503_CR6","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1002\/9780470253441.ch9","volume-title":"Bioinformatics Algorithms: Techniques and Applications, Wiley Series on Bioinformatics: Computational Techniques and Engineering","author":"S Rahmann","year":"2008","unstructured":"Rahmann S, Klau GW: Integer linear programming techniques for discovering approximate gene clusters. In Bioinformatics Algorithms: Techniques and Applications, Wiley Series on Bioinformatics: Computational Techniques and Engineering. Edited by: Mandoiu I, Zelikovsky A. Wiley; 2008:203\u2013222."},{"issue":"8","key":"4503_CR7","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 2009, 16(8):1085\u20131099. 10.1089\/cmb.2009.0098","journal-title":"J. Comput. Biol"},{"issue":"2","key":"4503_CR8","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 1997, 30(2):113\u2013119.","journal-title":"Theory Comput. Systems"},{"issue":"4","key":"4503_CR9","doi-asserted-by":"publisher","first-page":"1432","DOI":"10.1137\/080739069","volume":"39","author":"B Ma","year":"2009","unstructured":"Ma B, Sun X: More Effective Algorithms for Closest String and Substring Problems. SIAM J. Comput 2009, 39(4):1432\u20131443. [ http:\/\/link.aip.org\/link\/?SMJ\/39\/1432\/1 ]","journal-title":"SIAM J. Comput"},{"key":"4503_CR10","first-page":"591","volume-title":"Proc. of Advanced Data Mining and Applications Conference (ADMA 2005), Volume 3584 of Lect. Notes Comput. Sc., Springer","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. Proc. of Advanced Data Mining and Applications Conference (ADMA 2005), Volume 3584 of Lect. Notes Comput. Sc., Springer 2005, 591\u2013597. [ http:\/\/www.springerlink.com\/content\/4quu3p835k4d2txp\/ ]"},{"key":"4503_CR11","first-page":"370","volume-title":"Proc. of Current Trends in Theory and Practice of Computer Science (SOFSEM 2010), Volume 5901 of Lect. Notes Comput. Sc., Springer","author":"S Faro","year":"2010","unstructured":"Faro S, Pappalardo E: Ant-CSP: An Ant Colony Optimization Algorithm for the Closest String Problem. Proc. of Current Trends in Theory and Practice of Computer Science (SOFSEM 2010), Volume 5901 of Lect. Notes Comput. Sc., Springer 2010, 370\u2013381."},{"key":"4503_CR12","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 2003, 37: 25\u201342. 10.1007\/s00453-003-1028-3","journal-title":"Algorithmica"},{"key":"4503_CR13","first-page":"449","volume-title":"Proc. of Computing and Combinatorics Conference (COCOON 2010), Volume 6196 of Lect. Notes Comput. Sc., Springer","author":"ZZ Chen","year":"2010","unstructured":"Chen ZZ, Ma B, Wang L: A Three-String Approach to the Closest String Problem. Proc. of Computing and Combinatorics Conference (COCOON 2010), Volume 6196 of Lect. Notes Comput. Sc., Springer 2010, 449\u2013458."},{"issue":"4","key":"4503_CR14","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1287\/ijoc.1040.0090","volume":"16","author":"C Meneses","year":"2004","unstructured":"Meneses C, Lu Z, Oliveira C, Pardalos P: Optimal solutions for the closest-string problem via integer programming. INFORMS J. Computing 2004, 16(4):419\u2013429. 10.1287\/ijoc.1040.0090","journal-title":"INFORMS J. Computing"},{"key":"4503_CR15","volume-title":"Computing Research Repository","author":"T Kelsey","year":"2010","unstructured":"Kelsey T, Kotthoff L: The Exact Closest String Problem as a Constraint Satisfaction Problem. Computing Research Repository 2010. abs\/1005.0089 abs\/1005.0089"},{"key":"4503_CR16","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1016\/j.jda.2004.08.015","volume":"3","author":"F Nicolas","year":"2005","unstructured":"Nicolas F, Rivals E: Hardness results for the center and median string problems under the weighted and unweighted edit distances. Journal of Discrete Algorithms 2005, 3: 390\u2013415. 10.1016\/j.jda.2004.08.015","journal-title":"Journal of Discrete Algorithms"}],"container-title":["BMC Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/1471-2105-12-106.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/1471-2105-12-106\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/1471-2105-12-106.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,6]],"date-time":"2024-04-06T09:31:04Z","timestamp":1712395864000},"score":1,"resource":{"primary":{"URL":"https:\/\/bmcbioinformatics.biomedcentral.com\/articles\/10.1186\/1471-2105-12-106"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4,19]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,12]]}},"alternative-id":["4503"],"URL":"https:\/\/doi.org\/10.1186\/1471-2105-12-106","relation":{},"ISSN":["1471-2105"],"issn-type":[{"value":"1471-2105","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,4,19]]},"article-number":"106"}}