{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T19:02:46Z","timestamp":1779130966911,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642042409","type":"print"},{"value":"9783642042416","type":"electronic"}],"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-04241-6_30","type":"book-chapter","created":{"date-parts":[[2009,9,14]],"date-time":"2009-09-14T17:56:16Z","timestamp":1252950976000},"page":"362-374","source":"Crossref","is-referenced-by-count":7,"title":["MADMX: A Novel Strategy for Maximal Dense Motif Extraction"],"prefix":"10.1007","author":[{"given":"Roberto","family":"Grossi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Pietracaprina","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nadia","family":"Pisanti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Geppino","family":"Pucci","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eli","family":"Upfal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabio","family":"Vandin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"30_CR1","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proc. of 20th VLDB, pp. 487\u2013499 (1994)"},{"key":"30_CR2","doi-asserted-by":"crossref","unstructured":"Apostolico, A., Comin, M., Parida, L.: VARUN: discovering extensible motifs under saturation constraints. IEEE Trans. on Computational Biology and Bioinformatics (to appear, 2009)","DOI":"10.1109\/TCBB.2008.123"},{"issue":"1","key":"30_CR3","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1089\/106652704773416867","volume":"11","author":"A. Apostolico","year":"2004","unstructured":"Apostolico, A., Parida, L.: Incremental paradigms of motif discovery. Journal of Computational Biology\u00a011(1), 15\u201325 (2004)","journal-title":"Journal of Computational Biology"},{"key":"30_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/978-3-540-73545-8_36","volume-title":"Computing and Combinatorics","author":"A. Apostolico","year":"2007","unstructured":"Apostolico, A., Tagliacollo, C.: Optimal offline extraction of irredundant motif bases. In: Lin, G. (ed.) COCOON 2007. LNCS, vol.\u00a04598, pp. 360\u2013371. Springer, Heidelberg (2007)"},{"issue":"2-3","key":"30_CR5","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.tcs.2008.08.002","volume":"408","author":"A. Apostolico","year":"2008","unstructured":"Apostolico, A., Tagliacollo, C.: Incremental discovery of the irredundant motif bases for all suffixes of a string in O(n 2 log n) time. Theoretical Computer Science\u00a0408(2-3), 106\u2013115 (2008)","journal-title":"Theoretical Computer Science"},{"key":"30_CR6","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-3-540-78197-4_29","volume-title":"New Frontiers in Artificial Intelligence","author":"H. Arimura","year":"2008","unstructured":"Arimura, H., Uno, T.: Mining maximal flexible patterns in a sequence. In: Satoh, K., Inokuchi, A., Nagao, K., Kawamura, T. (eds.) JSAI 2007. LNCS (LNAI), vol.\u00a04914, pp. 307\u2013317. Springer, Heidelberg (2008)"},{"key":"30_CR7","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1159\/000084979","volume":"110","author":"J. Jurka","year":"2005","unstructured":"Jurka, J., Kapitonov, V.V., Pavlicek, A., Klonowski, P., Kohani, O., Walichiewicz, J.: Repbase Update, a database of eukaryotic repetitive elements. Cytogenet. Genome Res.\u00a0110, 462\u2013467 (2005)","journal-title":"Cytogenet. Genome Res."},{"key":"30_CR8","unstructured":"Morris, M., Nicolas, F., Ukkonen, E.: On the complexity of finding gapped motifs. CoRR, abs\/0802.0314 (2008)"},{"key":"30_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/3-540-45123-4_5","volume-title":"Combinatorial Pattern Matching","author":"L. Parida","year":"2000","unstructured":"Parida, L.: Some results on flexible-pattern discovery. In: Giancarlo, R., Sankoff, D. (eds.) CPM 2000. LNCS, vol.\u00a01848, pp. 33\u201345. Springer, Heidelberg (2000)"},{"key":"30_CR10","series-title":"Mathematical and Computational Biology Series","volume-title":"Pattern discovery in bioinformatics","author":"L. Parida","year":"2008","unstructured":"Parida, L.: Pattern discovery in bioinformatics. Mathematical and Computational Biology Series. Chapman & Hall \/ CRC, Boca Raton (2008)"},{"key":"30_CR11","unstructured":"Pisanti, N.: Segment-based distances and similarities in genomic sequences. PhD thesis, University of Pisa, Italy (2002)"},{"issue":"1","key":"30_CR12","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1109\/TCBB.2005.5","volume":"2","author":"N. Pisanti","year":"2005","unstructured":"Pisanti, N., Crochemore, M., Grossi, R., Sagot, M.F.: Bases of motifs for generating repeated patterns with wild cards. IEEE Trans. on Computational Biology and Bioinformatics\u00a02(1), 40\u201350 (2005)","journal-title":"IEEE Trans. on Computational Biology and Bioinformatics"},{"issue":"1","key":"30_CR13","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1093\/bioinformatics\/14.1.55","volume":"14","author":"I. Rigoutsos","year":"1998","unstructured":"Rigoutsos, I., Floratos, A.: Combinatorial pattern discovery in biological sequences: the TEIRESIAS algorithm. Bioinformatics\u00a014(1), 55\u201367 (1998)","journal-title":"Bioinformatics"},{"issue":"7","key":"30_CR14","doi-asserted-by":"publisher","first-page":"2284","DOI":"10.1093\/nar\/gkn064","volume":"36","author":"S. Saha","year":"2008","unstructured":"Saha, S., Bridges, S., Magbanua, Z.V., Peterson, D.G.: Empirical comparison of ab initio repeat finding programs. Nucleic Acids Res.\u00a036(7), 2284\u20132294 (2008)","journal-title":"Nucleic Acids Res."},{"key":"30_CR15","unstructured":"Smit, A.F.A., Hubley, R., Green, P.: RepeatMasker Open-3.0. 1996\u20132004, http:\/\/www.repeatmasker.org"},{"key":"30_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1007\/978-3-540-74456-6_60","volume-title":"Mathematical Foundations of Computer Science 2007","author":"E. Ukkonen","year":"2007","unstructured":"Ukkonen, E.: Structural analysis of gapped motifs of a string. In: Ku\u010dera, L., Ku\u010dera, A. (eds.) MFCS 2007. LNCS, vol.\u00a04708, pp. 681\u2013690. Springer, Heidelberg (2007)"}],"container-title":["Lecture Notes in Computer Science","Algorithms in Bioinformatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04241-6_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T15:20:13Z","timestamp":1558538413000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04241-6_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642042409","9783642042416"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04241-6_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}