{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T14:41:35Z","timestamp":1742395295543},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642007262"},{"type":"electronic","value":"9783642007279"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-00727-9_15","type":"book-chapter","created":{"date-parts":[[2009,4,21]],"date-time":"2009-04-21T04:45:52Z","timestamp":1240289152000},"page":"139-150","source":"Crossref","is-referenced-by-count":5,"title":["Detecting Motifs in a Large Data Set: Applying Probabilistic Insights to Motif Finding"],"prefix":"10.1007","author":[{"given":"Christina","family":"Boucher","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel G.","family":"Brown","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1002\/rsa.20168","volume":"31","author":"B. Bollobas","year":"2007","unstructured":"Bollobas, B., Janson, S., Riordan, O.: The phase transition in inhomogeneous random graphs. Random. Struct. Algor.\u00a031, 3\u2013122 (2007)","journal-title":"Random. Struct. Algor."},{"key":"15_CR2","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-540-74126-8_14","volume-title":"Algorithms in Bioinformatics","author":"C. Boucher","year":"2007","unstructured":"Boucher, C., Brown, D., Church, P.: A graph clustering approach to weak motif recognition. In: Giancarlo, R., Hannenhalli, S. (eds.) WABI 2007. LNCS (LNBI), vol.\u00a04645, pp. 149\u2013160. Springer, Heidelberg (2007)"},{"issue":"3","key":"15_CR3","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. J. Comput. Biol.\u00a09(3), 225\u2013242 (2002)","journal-title":"J. Comput. Biol."},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Chin, F.Y.L., Leung, C.M.: Voting algorithms for discovering long motifs. In: Proc. APBC 2005, pp. 261\u2013271 (2005)","DOI":"10.1142\/9781860947322_0026"},{"key":"15_CR5","unstructured":"Crawford, J.M., Auton, L.D.: Experimental results on the crossover point in satisfiability problems. In: Proc. AAAI 1993, pp. 21\u201327 (1993)"},{"issue":"1","key":"15_CR6","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1093\/bioinformatics\/18.suppl_1.S354","volume":"18","author":"E. Eskin","year":"2002","unstructured":"Eskin, E., Pevzner, P.A.: Finding composite regulatory patterns in DNA sequences. Bioinformatics\u00a018(1), 354\u2013363 (2002)","journal-title":"Bioinformatics"},{"key":"15_CR7","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1016\/S0304-3975(03)00320-7","volume":"306","author":"P.A. Evans","year":"2003","unstructured":"Evans, P.A., Smith, A., Wareham, H.T.: On the complexity of finding common approximate substrings. Th. Comp. Sci.\u00a0306, 407\u2013430 (2003)","journal-title":"Th. Comp. Sci."},{"key":"15_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-540-73437-6_26","volume-title":"Combinatorial Pattern Matching","author":"W. Feng","year":"2007","unstructured":"Feng, W., Wang, Z., Wang, L.: Identification of distinguishing motifs. In: Ma, B., Zhang, K. (eds.) CPM 2007. LNCS, vol.\u00a04580, pp. 253\u2013264. Springer, Heidelberg (2007)"},{"key":"15_CR9","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. Th. Comp. Sys.\u00a030, 113\u2013119 (1997)","journal-title":"Th. Comp. Sys."},{"issue":"4","key":"15_CR10","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. Fast and practical algorithms for planted (l, d) motif search. IEEE\/ACM Trans. Comput. Biol. Bioinf.\u00a04(4), 544\u2013552 (2007)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinf."},{"issue":"1","key":"15_CR11","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1006\/jcss.2002.1823","volume":"65","author":"M. Li","year":"2002","unstructured":"Li, M., Ma, B., Wang, L.: Finding similar regions in many strings. J. Comp. and Sys. Sci.\u00a065(1), 73\u201396 (2002)","journal-title":"J. Comp. and Sys. Sci."},{"key":"15_CR12","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0020-0190(92)90029-U","volume":"43","author":"E. Koutsoupias","year":"1992","unstructured":"Koutsoupias, E., Papadimitriou, C.H.: On the greedy algorithm for satisfiability. Inform. Process. Lett.\u00a043, 53\u201355 (1992)","journal-title":"Inform. Process. Lett."},{"key":"15_CR13","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R. Motwani","year":"1995","unstructured":"Motwani, R., Raghavan, R.: Randomized Algorithms. Cambridge University Press, New York (1995)"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H.: On selecting a satisfying truth assignment. In: Proc. FOCS 1991, pp. 163\u2013169 (1991)","DOI":"10.1109\/SFCS.1991.185365"},{"key":"15_CR15","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1093\/bioinformatics\/17.suppl_1.S207","volume":"17","author":"G. Pavesi","year":"2001","unstructured":"Pavesi, G., Mauri, G., Pesole, G.: An algorithm for finding signals of unknown length in DNA sequences. Bioinformatics\u00a017, S207\u2013S214 (2001)","journal-title":"Bioinformatics"},{"key":"15_CR16","unstructured":"Pennock, D.M., Stout., Q.F.: Exploiting a theory of phase transitions in three-satisfiability problems. In: Proc. AAAI 1996, pp. 253\u2013258 (1996)"},{"key":"15_CR17","unstructured":"Pevzner, P., Sze, S.: Combinatorial approaches to finding subtle signals in DNA sequences. In: Proc. ISMB 2000, pp. 344\u2013354 (2000)"},{"issue":"8","key":"15_CR18","doi-asserted-by":"publisher","first-page":"1117","DOI":"10.1089\/cmb.2005.12.1117","volume":"12","author":"S. Rajasekaran","year":"2005","unstructured":"Rajasekaran, S., Balla, S., Huang, C.H.: Exact algorithms for the planted motif problem. J. Comp. Bio.\u00a012(8), 1117\u20131128 (2005)","journal-title":"J. Comp. Bio."},{"key":"15_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/BFb0054337","volume-title":"LATIN\u201998: Theoretical Informatics","author":"M.-F. Sagot","year":"1998","unstructured":"Sagot, M.-F.: Spelling approximate repeated or common motifs using a suffix tree. In: Lucchesi, C.L., Moura, A.V. (eds.) LATIN 1998. LNCS, vol.\u00a01380, pp. 374\u2013390. Springer, Heidelberg (1998)"},{"key":"15_CR20","doi-asserted-by":"crossref","unstructured":"Sch\u00f6ning, U.: A probabilistic algorithm for k-SAT and constraint satisfaction problems. In: Proc. FOCS 1999, pp. 410\u2013414 (1999)","DOI":"10.1109\/SFFCS.1999.814612"},{"key":"15_CR21","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1007\/978-3-540-30219-3_37","volume-title":"Algorithms in Bioinformatics","author":"S. Sze","year":"2004","unstructured":"Sze, S., Lu, S., Chen, J.: Integrating sample-driven and pattern-driven approaches in motif finding. In: Jonassen, I., Kim, J. (eds.) WABI 2004. LNCS (LNBI), vol.\u00a03240, pp. 438\u2013449. Springer, Heidelberg (2004)"},{"key":"15_CR22","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1038\/nbt1053","volume":"23","author":"M. Tompa","year":"2005","unstructured":"Tompa, M., Li, N., Bailey, T.L., Church, G.M., De Moor, B., Eskin, E., Favorov, A.V., Frith, M.C., Fu, Y., Kent, W.J., Makeev, V.J., Mironov, A.A., Noble, W.S., Pavesi, G., Pesole, G., R\u00e9gnier, M., Simonis, N., Sinha, S., Thijs, G., van Helden, J., Vandenbogaert, M., Weng, Z., Workman, C., Ye, C., Zhu, Z.: Assessing computational tools for the discovery of transcription factor binding sites. Nat. Biotechnol.\u00a023, 137\u2013144 (2005)","journal-title":"Nat. Biotechnol."},{"issue":"1","key":"15_CR23","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1093\/nar\/24.1.238","volume":"24","author":"E. Wingender","year":"1996","unstructured":"Wingender, E., Dietze, P., Karas, H., Kn\u00fcppel, R.: TRANSFAC: a database on transcription factors and their DNA binding sites. Nucleic Acids Res.\u00a024(1), 238\u2013241 (1996)","journal-title":"Nucleic Acids Res."}],"container-title":["Lecture Notes in Computer Science","Bioinformatics and Computational Biology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00727-9_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,7]],"date-time":"2019-03-07T22:14:45Z","timestamp":1551996885000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00727-9_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642007262","9783642007279"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00727-9_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}