{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:47:12Z","timestamp":1725490032983},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540735441"},{"type":"electronic","value":"9783540735458"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"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":[[2007]]},"DOI":"10.1007\/978-3-540-73545-8_36","type":"book-chapter","created":{"date-parts":[[2007,8,17]],"date-time":"2007-08-17T13:44:11Z","timestamp":1187358251000},"page":"360-371","source":"Crossref","is-referenced-by-count":7,"title":["Optimal Offline Extraction of Irredundant Motif Bases"],"prefix":"10.1007","author":[{"given":"Alberto","family":"Apostolico","sequence":"first","affiliation":[]},{"given":"Claudia","family":"Tagliacollo","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"36_CR1","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195113679.001.0001","volume-title":"Pattern matching algorithms","author":"A. Apostolico","year":"1997","unstructured":"Apostolico, A., Galil, Z.: Pattern matching algorithms. Oxford University Press, New York (1997)"},{"issue":"1","key":"36_CR2","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1089\/106652704773416867","volume":"11","author":"A. Apostolico","year":"2004","unstructured":"Apostolico, A., Parida, L.: ncremental paradigms of motif discovery. Journal of Computational Biology\u00a011(1), 15\u201325 (2004)","journal-title":"Journal of Computational Biology"},{"key":"36_CR3","unstructured":"Apostolico, A.: Pattern discovery and the algorithmics of surprise. Artificial Intelligence and Heuristic Methods for Bioinformatics, pp. 111\u2013127 (2003)"},{"key":"36_CR4","doi-asserted-by":"crossref","unstructured":"Cole, R., Hariharan, R.: Verifying candidate matches in sparse and wildcard matching. In: STOC 2002. Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, pp. 592\u2013601 (2002)","DOI":"10.1145\/509907.509992"},{"key":"36_CR5","unstructured":"Fischer, M.J., Paterson, M.S.: String matching and other products. In: Karp, R. (ed.) Proceedings of the SIAM-AMS Complexity of Computation, Providence, R.I. American Mathematical Society, pp. 113\u2013125 (1974)"},{"issue":"1","key":"36_CR6","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/375360.375365","volume":"33","author":"G. Navarro","year":"2001","unstructured":"Navarro, G.: A guided tour to approximate string matching. ACM Computing Surveys\u00a033(1), 31\u201388 (2001)","journal-title":"ACM Computing Surveys"},{"issue":"2-4","key":"36_CR7","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/j.jda.2004.08.010","volume":"3","author":"J. Pelfr\u00eane","year":"2005","unstructured":"Pelfr\u00eane, J., Abdedda\u00efm, S., Alexandre, J.: Extracting approximate patterns. Journal of Discrete Algorithms\u00a03(2-4), 293\u2013320 (2005)","journal-title":"Journal of Discrete Algorithms"},{"key":"36_CR8","unstructured":"Parida, L.: Algorithmic Techniques in Computational Genomics. PhD thesis, Department of Computer Science, New York University (1998)"},{"issue":"1","key":"36_CR9","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\/ACM Trans. Comput. Biol. Bioinformatics\u00a02(1), 40\u201350 (2005)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinformatics"},{"key":"36_CR10","unstructured":"Parida, L., Rigoutsos, I., Floratos, A., Platt, D., Gao, Y.: Pattern discovery on character sets and real-valued data: linear bound on irredundant motifs and an efficient polynomial time algorithm. In: Symposium on Discrete Algorithms, pp. 297\u2013308 (2000)"},{"key":"36_CR11","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195119404.001.0001","volume-title":"Pattern Discovery in Biomolecular Data: Tools, Techniques and Applications","author":"J.T.L. Wang","year":"1999","unstructured":"Wang, J.T.L., Shapiro, B.A., Shasha, D.E.: Pattern Discovery in Biomolecular Data: Tools, Techniques and Applications. Oxford University Press, Oxford (1999)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73545-8_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,21]],"date-time":"2021-08-21T23:49:45Z","timestamp":1629589785000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73545-8_36"}},"subtitle":["(Extended Abstract)"],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540735441","9783540735458"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73545-8_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}