{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T22:15:37Z","timestamp":1794348937137,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540741251","type":"print"},{"value":"9783540741268","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74126-8_14","type":"book-chapter","created":{"date-parts":[[2007,8,23]],"date-time":"2007-08-23T11:37:50Z","timestamp":1187869070000},"page":"149-160","source":"Crossref","is-referenced-by-count":8,"title":["A Graph Clustering Approach to Weak Motif Recognition"],"prefix":"10.1007","author":[{"given":"Christina","family":"Boucher","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daniel G.","family":"Brown","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Paul","family":"Church","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"3","key":"14_CR1","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":"14_CR2","doi-asserted-by":"crossref","unstructured":"Chen, J., Huang, X., Kanj, I.A., Xia, G.: Linear FPT reductions and computational lower bounds. In: Proc. Sym. on Theory of Comp., pp. 212\u2013221 (2004)","DOI":"10.1145\/1007352.1007391"},{"key":"14_CR3","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, NY (1979)"},{"key":"14_CR4","unstructured":"King, J., Cheuny, W., Hoos, H.H.: Neighbourhood Thresholding for Projection-Based Motif Discovery. Bioinfo. (to appear)"},{"issue":"1","key":"14_CR5","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1142\/S0219720004000466","volume":"2","author":"S. Liang","year":"2004","unstructured":"Liang, S., Samanta, M.P., Biegel, B.A.: cWINNOWER algorithm for finding fuzzy DNA motifs. J. Bioinfo. Comput. Biol.\u00a02(1), 47\u201360 (2004)","journal-title":"J. Bioinfo. Comput. Biol."},{"key":"14_CR6","doi-asserted-by":"crossref","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, NY (1995)"},{"key":"14_CR7","unstructured":"Niedermeier, R.: Invitation to fixed-parameter algorithms. Habilitation thesis, Universit\u00e4t T\u00fcbingen (2002)"},{"key":"14_CR8","unstructured":"Pevzner, P., Sze, S.: Combinatorial approaches to finding subtle signals in DNA sequences. In: Proc. Int. Conf. Intell. Syst. Mol. Biol (ISMB 2000), vol.\u00a08, pp. 344\u2013354 (2000)"},{"issue":"2","key":"14_CR9","first-page":"63","volume":"15","author":"M.P. Styczynski","year":"2004","unstructured":"Styczynski, M.P., Jensen, K.L.: An extension and novel solution to the (1,d)-motif challenge problem. Gen. Info.\u00a015(2), 63\u201371 (2004)","journal-title":"Gen. Info."},{"key":"14_CR10","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"crossref","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 patter-driven approaches in motif finding. In: Jonassen, I., Kim, J. (eds.) WABI 2004. LNCS (LNBI), vol.\u00a03240, pp. 438\u2013449. Springer, Heidelberg (2004)"},{"key":"14_CR11","unstructured":"van Dongen, S.: Graph clustering by flow simulation. PhD thesis, University of Utrecht (May 2000)"},{"issue":"2","key":"14_CR12","first-page":"52","volume":"15","author":"X. Yang","year":"2004","unstructured":"Yang, X., Rajapakse, J.: Graphical approach to weak motif recognition. Gen. Info.\u00a015(2), 52\u201362 (2004)","journal-title":"Gen. Info."}],"container-title":["Lecture Notes in Computer Science","Algorithms in Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74126-8_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:11:27Z","timestamp":1619503887000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74126-8_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540741251","9783540741268"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74126-8_14","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-540-74126-8","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[]}}