{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:29:05Z","timestamp":1725474545644},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540689706"},{"type":"electronic","value":"9783540689713"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11960669_15","type":"book-chapter","created":{"date-parts":[[2006,11,27]],"date-time":"2006-11-27T18:56:02Z","timestamp":1164653762000},"page":"170-184","source":"Crossref","is-referenced-by-count":0,"title":["Discovering Consensus Patterns in Biological Databases"],"prefix":"10.1007","author":[{"given":"Mohamed Y.","family":"ElTabakh","sequence":"first","affiliation":[]},{"given":"Walid G.","family":"Aref","sequence":"additional","affiliation":[]},{"given":"Mourad","family":"Ouzzani","sequence":"additional","affiliation":[]},{"given":"Mohamed H.","family":"Ali","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal, C.C.: On effective classification of strings with wavelets. In: Proceedings of the 8th ACM SIGKDD, pp. 163\u2013172 (2002)","DOI":"10.1145\/775047.775071"},{"key":"15_CR2","unstructured":"Goethals, B.: Survey on frequent pattern mining (manuscript, 2003)"},{"key":"15_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/3-540-57301-1_5","volume-title":"Foundations of Data Organization and Algorithms","author":"R. Agrawal","year":"1993","unstructured":"Agrawal, R., Faloutsos, C., Swami, A.N.: Efficient similarity search in sequence databases. In: Lomet, D.B. (ed.) FODO 1993. LNCS, vol.\u00a0730, pp. 69\u201384. Springer, Heidelberg (1993)"},{"key":"15_CR4","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: VLDB, pp. 487\u2013499 (1994)"},{"issue":"4","key":"15_CR5","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/S0306-4379(99)00020-4","volume":"24","author":"W.G. Aref","year":"1999","unstructured":"Aref, W.G., Barbara, D.: Supporting electronic ink databases. Information Systems: An International Journal\u00a024(4), 303\u2013326 (1999)","journal-title":"Information Systems: An International Journal"},{"key":"15_CR6","unstructured":"Bailey, T., Elkan, C., Grundy, B.: The meme system: Multiple EM for motif elicitation, \n \n http:\/\/bioweb.pasteur.fr\/seqanal\/motif\/meme\/"},{"key":"15_CR7","unstructured":"Bailey, T.L., Elkan, C.: Fitting a mixture model by expectation maximization to discover motifs in biopolymers. In: ISMB, pp. 28\u201336 (1994)"},{"key":"15_CR8","unstructured":"Bailey, T.L., Elkan, C.: The value of prior knowledge in discovering motifs with meme. In: ISMB, pp. 21\u201329 (1995)"},{"key":"15_CR9","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1093\/nar\/27.2.573","volume":"27","author":"G. Benson","year":"1999","unstructured":"Benson, G.: Tandem repeats finder: a program to analyze dna sequences. Nucleic Acids Research\u00a027, 573\u2013580 (1999)","journal-title":"Nucleic Acids Research"},{"key":"15_CR10","unstructured":"Berkhin, P.: Survey of clustering data mining techniques, San Jose, CA (2002)"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Buhler, J., Tompa, M.: Finding motifs using random projections. In: RECOMB, pp. 69\u201376 (2001)","DOI":"10.1145\/369133.369172"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Fix, E., Hodges, J.L.: Discriminatory analysis, nonparametric discrimination: Consistency properties. In USAF School of Aviation Medicine, Project 21-49004, Report 4 (1951)","DOI":"10.1037\/e471672008-001"},{"key":"15_CR13","unstructured":"Ganesh, R., Ioerger, T.R., Siegele, D.A.: Mopac: Motif finding by preprocessing and agglomerative clustering from microarrays. In: PSB, pp. 41\u201352 (2003)"},{"key":"15_CR14","unstructured":"Halkidi, M., Batistakis, Y., Vazirgiannis, M.: Clustering algorithms and validity measures. Tutorial paper, SSDBM (2001)"},{"key":"15_CR15","volume-title":"Coding and information theory","author":"R.W. Hamming","year":"1980","unstructured":"Hamming, R.W.: Coding and information theory. Prentice-Hall, Englewood Cliffs (1980)"},{"key":"15_CR16","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1093\/bioinformatics\/15.7.563","volume":"15","author":"G.Z. Hertz","year":"1999","unstructured":"Hertz, G.Z., Stormo, G.D.: Identifying dna and protein patterns with statistically significant alignments of multiple sequences. Bioinformatics\u00a015, 563\u2013577 (1999)","journal-title":"Bioinformatics"},{"key":"15_CR17","doi-asserted-by":"crossref","unstructured":"Jagadish, H.V., Koudas, N., Srivastava, D.: On effective multi-dimensional indexing for strings. In: SIGMOD, pp. 403\u2013414 (2000)","DOI":"10.1145\/335191.335434"},{"key":"15_CR18","doi-asserted-by":"crossref","unstructured":"King, B.: Step-wise clustering procedures. J. Am. Stat. Assoc. 69 (1967)","DOI":"10.2307\/2282912"},{"key":"15_CR19","doi-asserted-by":"crossref","unstructured":"Landau, G.M., Schmidt, J.P.: An algorithm for approximate tandem repeats. In: CPM, pp. 120\u2013133 (1993)","DOI":"10.1007\/BFb0029801"},{"key":"15_CR20","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1126\/science.8211139","volume":"262","author":"C.E. Lawrence","year":"1993","unstructured":"Lawrence, C.E., Altschul, S.F., Boguski, M.S., Liu, J.S., Neuwald, A.F., Wootton, J.C.: Detecting subtle sequence signals a gibb\u2019s sampling strategy for multiple alignment. Science\u00a0262, 208\u2013214 (1993)","journal-title":"Science"},{"key":"15_CR21","unstructured":"Liang, C.: Copia: A new software for finding consensus patterns in unaligned protein sequences. Master thesis, University of Waterloo (2001)"},{"key":"15_CR22","first-page":"10","volume":"10","author":"G. Myers","year":"1998","unstructured":"Myers, G., Sagot, M.: Identifying satellites and periodic repetitions in biological sequences. Journal of Computational Biology\u00a010, 10\u201320 (1998)","journal-title":"Journal of Computational Biology"},{"key":"15_CR23","doi-asserted-by":"crossref","unstructured":"Nagy, G.: State of the art in pattern recognition. Proc. IEEE 56 (1968)","DOI":"10.1109\/PROC.1968.6414"},{"key":"15_CR24","unstructured":"Pevzner, P.A., Sze, S.: Combinatorial approaches to finding subtle signals in dna sequences. In: ISMB, pp. 269\u2013278 (2000)"},{"key":"15_CR25","first-page":"54","volume-title":"New techniques for the union-find problem","author":"J.A. Poutr La","year":"1990","unstructured":"La Poutr, J.A.: New techniques for the union-find problem, pp. 54\u201363. SIAM, Philadelphia (1990)"},{"key":"15_CR26","volume-title":"Numerical taxonomy","author":"P.H. Sneath","year":"1973","unstructured":"Sneath, P.H., Sokal, R.R.: Numerical taxonomy. Freeman, London (1973)"},{"volume-title":"Information Retrieval: Data Structures and Algorithms","year":"1992","key":"15_CR27","unstructured":"Frakes, W.B., Yates, R.B. (eds.): Information Retrieval: Data Structures and Algorithms. Prentice-Hall, Englewood Cliffs (1992)"},{"issue":"2","key":"15_CR28","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1145\/321941.321946","volume":"23","author":"E.M. McCreight","year":"1976","unstructured":"McCreight, E.M.: A space-economical suffix tree construction algorithm. Journal of ACM\u00a023(2), 262\u2013272 (1976)","journal-title":"Journal of ACM"},{"key":"15_CR29","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on strings, trees, and sequences: computer science and computational biology","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on strings, trees, and sequences: computer science and computational biology. Cambridge University Press, New York (1997)"},{"key":"15_CR30","doi-asserted-by":"crossref","unstructured":"Hamada, H., Seidman, M., Howard, B., Gorman, C.: Enhanced gene expression by the poly(dT-dG) poly(dC-dA) sequence. Molecular and Cellular Biology (1984)","DOI":"10.1128\/MCB.4.12.2622"}],"container-title":["Lecture Notes in Computer Science","Data Mining and Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11960669_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T17:22:00Z","timestamp":1558286520000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11960669_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540689706","9783540689713"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/11960669_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}