{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T16:00:09Z","timestamp":1787500809325,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540343813","type":"print"},{"value":"9783540343820","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11758525_110","type":"book-chapter","created":{"date-parts":[[2006,5,11]],"date-time":"2006-05-11T11:03:32Z","timestamp":1147345412000},"page":"822-829","source":"Crossref","is-referenced-by-count":24,"title":["Space and Time Efficient Algorithms for Planted Motif Search"],"prefix":"10.1007","author":[{"given":"Jaime","family":"Davila","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sudha","family":"Balla","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sanguthevar","family":"Rajasekaran","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"110_CR1","unstructured":"Balla, S., Davila, J., Rajasekaran, S.: Approximation Algorithms for the Primer Selection, Planted Motif Search and Related Problems. In: Approximation Algorithms and Metaheuristics (to Appear)"},{"issue":"2","key":"110_CR2","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1089\/10665270252935430","volume":"9","author":"J. Buhler","year":"2002","unstructured":"Buhler, J., Tompa, M.: Finding motifs using random projections. Journal of Computational Biology\u00a09(2), 225\u2013242 (2002)","journal-title":"Journal of Computational Biology"},{"key":"110_CR3","doi-asserted-by":"crossref","unstructured":"Chin, F.Y., Leung, H.C.: Voting algorithms for discovering long motifs. In: APBC (2005)","DOI":"10.1142\/9781860947322_0026"},{"key":"110_CR4","doi-asserted-by":"crossref","unstructured":"Eskin, E., Pevzner, P.A.: Finding composite regulatory patterns in dna sequences. In: ISMB, pp. 354\u2013363 (2002)","DOI":"10.1093\/bioinformatics\/18.suppl_1.S354"},{"key":"110_CR5","doi-asserted-by":"crossref","unstructured":"Evans, P., Smith, A.: Toward optimal motif enumeration. In: WADS (2003)","DOI":"10.1007\/978-3-540-45078-8_5"},{"key":"110_CR6","doi-asserted-by":"crossref","unstructured":"Evans, P., Smith, A., Wareham, H.T.: On the complexity of finding common approximate substrings. TCS: Theoretical Computer Science 306 (2003)","DOI":"10.1016\/S0304-3975(03)00320-7"},{"issue":"2","key":"110_CR7","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":"110_CR8","unstructured":"Pevzner, P.A., Sze, S.H.: Combinatorial approaches to finding subtle signals in DNA sequences. In: ISMB, pp. 269\u2013278 (2000)"},{"key":"110_CR9","doi-asserted-by":"crossref","unstructured":"Price, A.L., Ramabhadran, S., Pevzner, P.A.: Finding subtle motifs by branching from sample strings. In: ECCB, pp. 149\u2013155 (2003)","DOI":"10.1093\/bioinformatics\/btg1072"},{"issue":"8","key":"110_CR10","doi-asserted-by":"publisher","first-page":"1117","DOI":"10.1089\/cmb.2005.12.1117","volume":"12","author":"S. Rajasekaran","year":"2005","unstructured":"Rajasekaran, S.: Exact algorithms for planted motif problems. Journal of Computational Biology\u00a012(8), 1117\u20131128 (2005)","journal-title":"Journal of Computational Biology"},{"key":"110_CR11","volume-title":"Handbook of Computational Molecular Biology","author":"S. Rajasekaran","year":"2005","unstructured":"Rajasekaran, S.: Motif Search Algorithms. In: Handbook of Computational Molecular Biology. CRC Press, Boca Raton (2005)"},{"key":"110_CR12","doi-asserted-by":"crossref","unstructured":"Sze, S.H., Lu, S., Chen, J.: Integrating sample-driven and pattern-driven approaches in motif finding. In: WABI (2004)","DOI":"10.1007\/978-3-540-30219-3_37"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11758525_110","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,18]],"date-time":"2019-04-18T15:41:24Z","timestamp":1555602084000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11758525_110"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540343813","9783540343820"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11758525_110","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}