{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:42:10Z","timestamp":1725493330524},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540001881"},{"type":"electronic","value":"9783540361824"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36182-0_6","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T13:10:33Z","timestamp":1193490633000},"page":"34-46","source":"Crossref","is-referenced-by-count":2,"title":["Discovering Frequent Structured Patterns from String Databases: An Application to Biological Sequences"],"prefix":"10.1007","author":[{"given":"Luigi","family":"Palopoli","sequence":"first","affiliation":[]},{"given":"Giorgio","family":"Terracina","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,11,8]]},"reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1016\/S0022-0000(05)80047-9","volume":"49","author":"A. Amir","year":"1994","unstructured":"A. Amir, M. Farach, Z. Galil, R. Giancarlo, and K. Park. Dinamic dictionary matching. Journal of Computer and System Science, 49:208\u2013222, 1994.","journal-title":"Journal of Computer and System Science"},{"key":"6_CR2","unstructured":"A. Apostolico and M. Crochemore. String matching for a deluge survival kit. Handbook of Massive Data Sets, To appear."},{"key":"6_CR3","doi-asserted-by":"crossref","first-page":"2013","DOI":"10.1093\/nar\/20.suppl.2013","volume":"20","author":"A. Bairoch","year":"1992","unstructured":"A. Bairoch. PROSITE: A dictionary of protein sites and patterns. Nucleic Acid Research, 20:2013\u20132018, 1992.","journal-title":"Nucleic Acid Research"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"G. Benson. An algorithm for finding tandem repeats of unspecified pattern size. In Proceedings of ACM Recomb, pages 20\u201329, 1998.","DOI":"10.1145\/279069.279079"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"P. Bieganski, J. Riedl, J. V. Carlis, and E. M. Retzel. Generalized suffix trees for biological sequence data: Applications and implementations. In Proc. of the 27th Hawai Int. Conf. on Systems Science, pages 35\u201344. IEEE Computer Society Press, 1994.","DOI":"10.1109\/HICSS.1994.323593"},{"issue":"2","key":"6_CR6","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1089\/cmb.1998.5.279","volume":"5","author":"A. Brazma","year":"1998","unstructured":"A. Brazma, I. Jonassen, I. Eidhammer, and D. Gilbert. Approaches to the automatic discovery of patterns in biosequences. Journal of Computational Biology, 5(2):277\u2013304, 1998.","journal-title":"Journal of Computational Biology"},{"key":"6_CR7","first-page":"379","volume":"11","author":"Y. M. Fraenkel","year":"1995","unstructured":"Y. M. Fraenkel, Y. Mandel, D. Friedberg, and H. Margalit. Identification of common motifs in unaligned dna sequnces: application to escherichia coli lrp regulon. Computer Applied Bioscience, 11:379\u2013387, 1995.","journal-title":"Computer Applied Bioscience"},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/0022-2836(85)90262-1","volume":"186","author":"D. J. Galas","year":"1985","unstructured":"D. J. Galas, M. Eggert, and M. S. Waterman. Rigorous pattern-recognition methods for dna sequences: Analysis of promoter sequences from escherichia coli. J. of Molecular Biology, 186:117\u2013128, 1985.","journal-title":"J. of Molecular Biology"},{"key":"6_CR9","first-page":"129","volume":"1","author":"C. A. Gross","year":"1992","unstructured":"C. A. Gross, M. Lonetto, and R. Losick. Bacterial sigma factors. Transcriptional Regulation, 1:129\u2013176, 1992.","journal-title":"Transcriptional Regulation"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"D. Gusfield. Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. Cambrige University Press, 1997.","DOI":"10.1017\/CBO9780511574931"},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0020-0190(92)90176-V","volume":"41","author":"D. Gusfield","year":"1992","unstructured":"D. Gusfield, G. M. Landau, and B. Schieber. An efficient algorithm of all pairs suffix-prefix problem. Information Processing Letters, 41:181\u2013185, 1992.","journal-title":"Information Processing Letters"},{"issue":"8","key":"6_CR12","doi-asserted-by":"publisher","first-page":"1808","DOI":"10.1093\/nar\/28.8.1808","volume":"28","author":"J. Helden","year":"2000","unstructured":"J. Helden, A. F. Rios, and J. Collado-Vides. Discovering regulatory elements in noncoding sequences by analysis of spaced dyads. Nucleic Acids Research, 28(8):1808\u20131818, 2000.","journal-title":"Nucleic Acids Research"},{"key":"6_CR13","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1093\/bioinformatics\/15.3.180","volume":"15","author":"A. Klingenhofen","year":"1999","unstructured":"A. Klingenhofen, K. Frech, K. Quandt, and T. Werner. Functional promoter modules can be detected by formal methods independent of overall sequence similarity. Bioinformatics, 15:180\u2013186, 1999.","journal-title":"Bioinformatics"},{"key":"6_CR14","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1089\/106652700750050826","volume":"7","author":"L. Marsan","year":"2000","unstructured":"L. Marsan and M. F. Sagot. Algorithms for extracting structured motifs using a suffix tree with application to promoter and regulatory site consensus identification. Journal of Computational Biology, 7:345\u2013360, 2000.","journal-title":"Journal of Computational Biology"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"M. F. Sagot and E. W. Myers. Identifying satellites in nucleic acid sequences. In Proc. of ACM RECOMB, pages 234\u2013242, 1998.","DOI":"10.1145\/279069.279120"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"H. O. Smith, T. M. Annau, and S. Chandrasegaran. Finding sequence motifs in groups of functionally related proteins. In Proc. of National Academy of Science, pages 118\u2013122, U.S.A., 1990.","DOI":"10.1073\/pnas.87.2.826"},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"R. L. Tatusov, S. F. Altschul, and E. V. Koonin. Detection of conserved segments in proteins. In Proc. of National Academy of Science, pages 12091\u201312095, U.S.A., 1994.","DOI":"10.1073\/pnas.91.25.12091"}],"container-title":["Lecture Notes in Computer Science","Discovery Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36182-0_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T22:12:58Z","timestamp":1556921578000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36182-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540001881","9783540361824"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-36182-0_6","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}