{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T05:57:01Z","timestamp":1777442221111,"version":"3.51.4"},"reference-count":12,"publisher":"Elsevier BV","issue":"17","license":[{"start":{"date-parts":[[2009,8,1]],"date-time":"2009-08-01T00:00:00Z","timestamp":1249084800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2009,8]]},"DOI":"10.1016\/j.ipl.2009.06.007","type":"journal-article","created":{"date-parts":[[2009,6,19]],"date-time":"2009-06-19T08:22:59Z","timestamp":1245399779000},"page":"1015-1020","source":"Crossref","is-referenced-by-count":8,"title":["Optimal extraction of motif patterns in 2D"],"prefix":"10.1016","volume":"109","author":[{"given":"Simona E.","family":"Rombo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.ipl.2009.06.007_bib001","doi-asserted-by":"crossref","unstructured":"Apostolico, C. Tagliacollo, Optimal offline extraction of irredundant motif bases, in: Proceedings of Computing and Combinatorics (COCOON 2007), 2007, pp. 360\u2013371","DOI":"10.1007\/978-3-540-73545-8_36"},{"key":"10.1016\/j.ipl.2009.06.007_bib002","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/j.tcs.2008.08.002","article-title":"Incremental discovery of the irredundant motif bases for all suffixes of a string in O(n2logn) time","volume":"408","author":"Apostolico","year":"2008","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"10.1016\/j.ipl.2009.06.007_bib003","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1089\/106652704773416867","article-title":"Incremental paradigms of motif discovery","volume":"11","author":"Apostolico","year":"2004","journal-title":"J. of Comp. Biol."},{"issue":"1","key":"10.1016\/j.ipl.2009.06.007_bib004","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/j.tcs.2007.10.019","article-title":"Motif patterns in 2D","volume":"390","author":"Apostolico","year":"2008","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"10.1016\/j.ipl.2009.06.007_bib005","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1089\/cmb.1998.5.279","article-title":"Approaches to the automatic discovery of patterns in biosequences","volume":"5","author":"Brazma","year":"1998","journal-title":"J. of Comp. Biol."},{"issue":"S1","key":"10.1016\/j.ipl.2009.06.007_bib006","doi-asserted-by":"crossref","first-page":"S354","DOI":"10.1093\/bioinformatics\/18.suppl_1.S354","article-title":"Finding composite regulatory patterns in DNA sequences","volume":"18","author":"Eskin","year":"2002","journal-title":"Bioinformatics"},{"key":"10.1016\/j.ipl.2009.06.007_bib007","unstructured":"M. Fisher, M. Paterson, String matching and other products, in: Proceedings of Complexity of Computation (SIAM\u2013AMS), 1974, pp. 113\u2013125"},{"issue":"3","key":"10.1016\/j.ipl.2009.06.007_bib008","first-page":"159","article-title":"Bases of motifs for generating repeated patterns with wild cards","volume":"2","author":"Grossi","year":"2000","journal-title":"IEEE\/ACM Trans. Comp. Biol. Bioinf."},{"key":"10.1016\/j.ipl.2009.06.007_bib009","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1089\/106652700750050826","article-title":"Algorithms for extracting structured motifs using a suffix tree with application to promoter and regulatory site consensus identification","volume":"7","author":"Marsan","year":"2000","journal-title":"J. of Comp. Biol."},{"key":"10.1016\/j.ipl.2009.06.007_bib010","unstructured":"L. Parida, Algorithmic techniques in computational genomics, PhD thesis, Department of Computer Science, New York University 1998"},{"key":"10.1016\/j.ipl.2009.06.007_bib011","unstructured":"L. Parida, I. Rigoutsos, A. Floratos, D. Platt, Y. Gao, Pattern discovery on character sets and real-valued data: linear bound on irredundant motifs and polynomial time algorithms, in: Proc. of ACM\u2013SIAM Symp. on Discr. Alg. (SODA 2000), 2000, pp. 297\u2013308"},{"issue":"3","key":"10.1016\/j.ipl.2009.06.007_bib012","article-title":"The emergence of pattern discovery techniques in computational biology","volume":"2","author":"Rigoutsos","year":"2000","journal-title":"J. Metabolic Engineering"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019009001926?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019009001926?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T00:12:16Z","timestamp":1558397536000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019009001926"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,8]]},"references-count":12,"journal-issue":{"issue":"17","published-print":{"date-parts":[[2009,8]]}},"alternative-id":["S0020019009001926"],"URL":"https:\/\/doi.org\/10.1016\/j.ipl.2009.06.007","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2009,8]]}}}