{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:08:27Z","timestamp":1725566907656},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540262015"},{"type":"electronic","value":"9783540315629"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11496656_13","type":"book-chapter","created":{"date-parts":[[2010,9,25]],"date-time":"2010-09-25T19:17:26Z","timestamp":1285442246000},"page":"144-155","source":"Crossref","is-referenced-by-count":4,"title":["Hardness of Optimal Spaced Seed Design"],"prefix":"10.1007","author":[{"given":"Fran\u00e7ois","family":"Nicolas","sequence":"first","affiliation":[]},{"given":"Eric","family":"Rivals","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"13_CR1","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1016\/S0022-2836(05)80360-2","volume":"215","author":"S.F. Altschul","year":"1990","unstructured":"Altschul, S.F., Gish, W., Miller, W., Meyers, E.W., Lipman, D.J.: Basic local alignment search tool. Journal of Molecular Biology\u00a0215(3), 403\u2013410 (1990)","journal-title":"Journal of Molecular Biology"},{"issue":"1","key":"13_CR2","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1002\/j.1538-7305.1953.tb01422.x","volume":"32","author":"W.C. Babcock","year":"1953","unstructured":"Babcock, W.C.: Intermodulation interference in radio systems. Bell System Technical Journal\u00a032(1), 63\u201373 (1953)","journal-title":"Bell System Technical Journal"},{"key":"13_CR3","first-page":"77","volume-title":"Third Annual International Conference on Computational Molecular Biology","author":"S. Burkhardt","year":"1999","unstructured":"Burkhardt, S., Crauser, A., Ferragina, P., Lenhof, H.-P., Rivals, E., Vingron, M.: qgram Based Database Searching Using a Suffix Array (QUASAR). In: Third Annual International Conference on Computational Molecular Biology, Lyon, France, April 11\u201314, pp. 77\u201383. ACM Press, New York (1999)"},{"issue":"1\u20132","key":"13_CR4","first-page":"51","volume":"56","author":"S. Burkhardt","year":"2003","unstructured":"Burkhardt, S., K\u00e4rkk\u00e4inen, J.: Better filtering with gapped q-grams. Fundamenta Informaticae\u00a056(1\u20132), 51\u201370 (2003)","journal-title":"Fundamenta Informaticae"},{"key":"13_CR5","first-page":"56","volume-title":"Proceedings of the 1st International Conference on Intelligent Systems for Molecular Biology","author":"A. Califano","year":"1993","unstructured":"Califano, A., Rigoutsos, I.: FLASH: A fast look-up algorithm for string homology. In: Hunter, L., Searls, D., Shavlik, J. (eds.) Proceedings of the 1st International Conference on Intelligent Systems for Molecular Biology, Menlo Park, CA, USA, July 1993, pp. 56\u201364. AAAI Press, Menlo Park (1993)"},{"key":"13_CR6","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, Heidelberg (1999)"},{"key":"13_CR7","unstructured":"Farach-Colton, M., Landau, G.M., Cenk Sahinalp, S., Tsur, D.: Optimal spaced seeds that avoid false negatives, \n                  \n                    http:\/\/cs.haifa.ac.il\/~landau\/gadi\/seeds.ps"},{"issue":"4","key":"13_CR8","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U. Feige","year":"1998","unstructured":"Feige, U.: A threshold of ln n for approximating set cover. Journal of the Association for Computing Machinery\u00a045(4), 634\u2013652 (1998)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"13_CR9","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Co., New York (1979)"},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF02392825","volume":"182","author":"J. H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J.: Clique is hard to approximate within n1\u2009\u2212\u2009\u03b5\n                        . Acta Mathematica\u00a0182, 105\u2013142 (1999)","journal-title":"Acta Mathematica"},{"key":"13_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/978-3-540-27801-6_22","volume-title":"Combinatorial Pattern Matching","author":"G. Kucherov","year":"2004","unstructured":"Kucherov, G., No\u00e9, L., Roytberg, M.: Multi-seed lossless filtration. In: Sahinalp, S.C., Muthukrishnan, S.M., Dogrusoz, U. (eds.) CPM 2004. LNCS, vol.\u00a03109, pp. 297\u2013310. Springer, Heidelberg (2004)"},{"issue":"3","key":"13_CR12","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1142\/S0219720004000661","volume":"2","author":"M. Li","year":"2004","unstructured":"Li, M., Ma, B., Kisman, D., Tromp, J.: PatternHunter II: Highly sensitive and fast homology search. Journal of Bioinformatics and Computational Biology\u00a02(3), 417\u2013439 (2004)","journal-title":"Journal of Bioinformatics and Computational Biology"},{"issue":"3","key":"13_CR13","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1093\/bioinformatics\/18.3.440","volume":"18","author":"B. Ma","year":"2002","unstructured":"Ma, B., Tromp, J., Li, M.: Patternhunter: faster and more sensitive homology search. Bioinformatics\u00a018(3), 440\u2013445 (2002)","journal-title":"Bioinformatics"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"No\u00e9, L., Kucherov, G.: Improved hit criteria for DNA local alignment. BMC Bioinformatics\u00a05(149) (2004), doi:10.1186\/1471-2105-5-149.","DOI":"10.1186\/1471-2105-5-149"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11496656_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:40:10Z","timestamp":1619505610000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11496656_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540262015","9783540315629"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11496656_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}