{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T15:17:50Z","timestamp":1764688670192},"reference-count":19,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":2060,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2008,1]]},"DOI":"10.1016\/j.tcs.2007.10.019","type":"journal-article","created":{"date-parts":[[2007,11,20]],"date-time":"2007-11-20T07:20:48Z","timestamp":1195543248000},"page":"40-55","source":"Crossref","is-referenced-by-count":17,"title":["Motif patterns in 2D"],"prefix":"10.1016","volume":"390","author":[{"given":"Alberto","family":"Apostolico","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laxmi","family":"Parida","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simona E.","family":"Rombo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2007.10.019_b1","unstructured":"A. Amir, G. Benson, Two-dimensional periodicity and its applications, in: Proceedings of the Symposium on Discrete Algorithms, SODA 1992, 1992, pp. 440\u2013452"},{"key":"10.1016\/j.tcs.2007.10.019_b2","doi-asserted-by":"crossref","unstructured":"A. Amir, O. Kapah, D. Tsur, Faster two dimensional pattern matching with rotations, in: Proceedings of Combinatorial Pattern Matching, CPM 2004, 2004, pp. 409\u2013419","DOI":"10.1007\/978-3-540-27801-6_31"},{"issue":"1\u20132","key":"10.1016\/j.tcs.2007.10.019_b3","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/j.tcs.2003.10.039","article-title":"Two-dimensional pattern matching with rotations","volume":"314","author":"Amir","year":"2004","journal-title":"Theoret. Comput. Sci."},{"issue":"5","key":"10.1016\/j.tcs.2007.10.019_b4","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/0020-0190(92)90206-B","article-title":"Two-dimensional dictionary matching","volume":"44","author":"Amir","year":"1992","journal-title":"Inform. Process. Lett."},{"issue":"1\u20133","key":"10.1016\/j.tcs.2007.10.019_b5","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/j.dam.2005.02.019","article-title":"Optimal discovery of repetitions in 2D","volume":"151","author":"Apostolico","year":"2005","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"10.1016\/j.tcs.2007.10.019_b6","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. Comput. Biol."},{"key":"10.1016\/j.tcs.2007.10.019_b7","unstructured":"A. Apostolico, L. Parida, Compression and the wheel of fortune, in: Proceedings of IEEE Data Compression Conference, 2004, pp. 115\u2013125"},{"key":"10.1016\/j.tcs.2007.10.019_b8","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1137\/0207043","article-title":"A technique for extending rapid exact-match string matching to arrays of more than one dimension","volume":"7","author":"Baker","year":"1978","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.tcs.2007.10.019_b9","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1016\/0020-0190(77)90017-5","article-title":"Two dimensional pattern matching","volume":"6","author":"Bird","year":"1997","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/j.tcs.2007.10.019_b10","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0304-3975(85)90157-4","article-title":"The smallest automaton recognizing the subwords of a text","volume":"40","author":"Blumer","year":"1985","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"10.1016\/j.tcs.2007.10.019_b11","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. Comput. Biol."},{"key":"10.1016\/j.tcs.2007.10.019_b12","doi-asserted-by":"crossref","unstructured":"R. Cole, R. Hariharan, Verifying candidate matches in sparse and wildcard matching, in: Proceedings of the Symposium on Theory of Computing, STOC 2002, 2002, pp. 592-601","DOI":"10.1145\/509989.509992"},{"key":"10.1016\/j.tcs.2007.10.019_b13","series-title":"Complexity of Computation","first-page":"113","article-title":"String matching and other products","volume":"vol. 7","author":"Fisher","year":"1974"},{"issue":"2","key":"10.1016\/j.tcs.2007.10.019_b14","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1137\/S0895480101390308","article-title":"Three-dimensional periodicity and its application to pattern matching","volume":"18","author":"Galil","year":"2004","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"10.1016\/j.tcs.2007.10.019_b15","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1109\/TCBB.2005.5","article-title":"Bases of motifs for generating repeated patterns with wild cards","volume":"2","author":"Grossi","year":"2005","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinf."},{"key":"10.1016\/j.tcs.2007.10.019_b16","doi-asserted-by":"crossref","unstructured":"J.C. Na, R. Giancarlo, K. Park, O(n2logn) time on-line construction of two-dimensional suffix trees, in: Proceedings of Computing and Combinatorics, COCOON 2005, 2005, pp. 273\u2013282","DOI":"10.1007\/11533719_29"},{"issue":"3","key":"10.1016\/j.tcs.2007.10.019_b17","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1006\/mben.2000.0151","article-title":"The emergence of pattern discovery techniques in computational biology","volume":"2","author":"Rigoutsos","year":"2000","journal-title":"J. Metabolic Eng."},{"issue":"2","key":"10.1016\/j.tcs.2007.10.019_b18","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1145\/356924.356930","article-title":"The quadtree and related hierarchical data structures","volume":"16","author":"Samet","year":"1984","journal-title":"ACM Comput. Surv."},{"key":"10.1016\/j.tcs.2007.10.019_b19","series-title":"Pattern Discovery in Biomolecular Data: Tools, Techniques and Applications","author":"Wang","year":"1999"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397507007645?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397507007645?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T16:38:38Z","timestamp":1556987918000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397507007645"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,1]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,1]]}},"alternative-id":["S0304397507007645"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2007.10.019","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2008,1]]}}}