{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:29:42Z","timestamp":1725488982819},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540744559"},{"type":"electronic","value":"9783540744566"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74456-6_60","type":"book-chapter","created":{"date-parts":[[2007,8,14]],"date-time":"2007-08-14T03:29:48Z","timestamp":1187062188000},"page":"681-690","source":"Crossref","is-referenced-by-count":5,"title":["Structural Analysis of Gapped Motifs of a String"],"prefix":"10.1007","author":[{"given":"Esko","family":"Ukkonen","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"60_CR1","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. J. Computational Biology\u00a011, 15\u201325 (2004)","journal-title":"J. Computational Biology"},{"key":"60_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"724","DOI":"10.1007\/11602613_73","volume-title":"Algorithms and Computation","author":"H. Arimura","year":"2005","unstructured":"Arimura, H., Uno, T.: A polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol.\u00a03827, pp. 724\u2013737. Springer, Heidelberg (2005)"},{"key":"60_CR3","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1016\/j.tcs.2006.06.029","volume":"362","author":"M. Crochemore","year":"2006","unstructured":"Crochemore, M., Iliopoulos, C.S., Mohamed, M., Sagot, M.-F.: Longest repeats with a block of k don\u2019t cares. Theoretical Computer Science\u00a0362, 248\u2013254 (2006)","journal-title":"Theoretical Computer Science"},{"key":"60_CR4","doi-asserted-by":"crossref","DOI":"10.1142\/4838","volume-title":"Jewels of Stringology","author":"M. Crochemore","year":"2002","unstructured":"Crochemore, M., Rytter, W.: Jewels of Stringology. World Scientific, Singapore (2002)"},{"unstructured":"Fischer, M.J., Paterson, M.S.: String matching and other products. In: Complexity of Computation. SIAM\u2013AMS Proc, pp. 113\u2013125 (1974)","key":"60_CR5"},{"key":"60_CR6","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees, and Sequences","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences. Cambridge University Press, Cambridge (1997)"},{"unstructured":"Michael, M., Nicolas, F., Ukkonen, E.: On the complexity of finding gapped motifs. Submitted manuscript (2007)","key":"60_CR7"},{"key":"60_CR8","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. J. Discrete Algorithms\u00a03, 293\u2013320 (2005)","journal-title":"J. Discrete Algorithms"},{"key":"60_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"622","DOI":"10.1007\/978-3-540-45138-9_56","volume-title":"Mathematical Foundations of Computer Science 2003","author":"N. Pisanti","year":"2003","unstructured":"Pisanti, N., Crochemore, M., Grossi, R., Sagot, M.-F.: A basis of tiling motifs for generating repeated patterns and its complexity for higher quorum. In: Rovan, B., Vojt\u00e1\u0161, P. (eds.) MFCS 2003. LNCS, vol.\u00a02747, pp. 622\u2013631. Springer, Heidelberg (2003)"},{"key":"60_CR10","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 Transactions on Computational Biology and Bioinformatics\u00a02, 40\u201350 (2005)","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74456-6_60.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:29:32Z","timestamp":1619504972000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74456-6_60"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540744559","9783540744566"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74456-6_60","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}