{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:59:36Z","timestamp":1725566376702},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540232100"},{"type":"electronic","value":"9783540302131"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30213-1_41","type":"book-chapter","created":{"date-parts":[[2010,9,21]],"date-time":"2010-09-21T19:26:07Z","timestamp":1285097167000},"page":"286-297","source":"Crossref","is-referenced-by-count":4,"title":["Motif Extraction from Weighted Sequences"],"prefix":"10.1007","author":[{"given":"Costas S.","family":"Iliopoulos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Katerina","family":"Perdikuri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Evangelos","family":"Theodoridis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Athanasios","family":"Tsakalidis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kostas","family":"Tsichlas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"41_CR1","first-page":"134","volume":"1","author":"G. Brodal","year":"2000","unstructured":"Brodal, G., Lyngso, R., Pedersen, C., Stoye, J.: Finding Maximal Pairs with Bounded Gap. Journal of Discrete Algorithms\u00a01, 134\u2013149 (2000)","journal-title":"Journal of Discrete Algorithms"},{"issue":"2","key":"41_CR2","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1145\/322123.322127","volume":"26","author":"M.R. Brown","year":"1979","unstructured":"Brown, M.R., Tarjan, R.E.: A Fast Merging Algorithm. J. ACM\u00a026(2), 211\u2013226 (1979)","journal-title":"J. ACM"},{"key":"41_CR3","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/BF01840440","volume":"1","author":"B. Chazelle","year":"1986","unstructured":"Chazelle, B., Guibas, L.J.: Fractional Cascading: I. A data structuring technique. Algorithmica\u00a01, 133\u2013162 (1986)","journal-title":"Algorithmica"},{"key":"41_CR4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, New York (1997)"},{"key":"41_CR5","unstructured":"Iliopoulos, C., Makris, C., Panagis, I., Perdikuri, K., Theodoridis, E., Tsakalidis, A.: Computing the Repetitions in a Weighted Sequence using Weighted Suffix Trees. In: Proc. of the European Conference On Computational Biology, ECCB (2003)"},{"key":"41_CR6","unstructured":"Iliopoulos, C., Makris, C., Panagis, I., Perdikuri, K., Theodoridis, E., Tsakalidis, A.: Efficient Algorithms for Handling Molecular Weighted Sequences. Accepted for presentation in IFIP TCS (2004)"},{"key":"41_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/3-540-45452-7_12","volume-title":"Combinatorial Pattern Matching","author":"C. Iliopoulos","year":"2002","unstructured":"Iliopoulos, C., Makris, C., Sioutas, S., Tsakalidis, A., Tsichlas, K.: Identifying occurrences of maximal pairs in multiple strings. In: Apostolico, A., Takeda, M. (eds.) CPM 2002. LNCS, vol.\u00a02373, pp. 133\u2013143. Springer, Heidelberg (2002)"},{"key":"41_CR8","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1089\/106652700750050826","volume":"7","author":"L. Marsan","year":"2000","unstructured":"Marsan, L., Sagot, M.-F.: Algorithms for extracting structured motifs using a suffix tree with application to promoter and regulatory site consensus identification. Journal of Computational Biology\u00a07, 345\u2013360 (2000)","journal-title":"Journal of Computational Biology"},{"key":"41_CR9","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1145\/321941.321946","volume":"23","author":"E.M. McCreight","year":"1976","unstructured":"McCreight, E.M.: A Space-Economical Suffix Tree Construction Algorithm. Journal of the ACM\u00a023, 262\u2013272 (1976)","journal-title":"Journal of the ACM"},{"key":"41_CR10","doi-asserted-by":"crossref","first-page":"2196","DOI":"10.1126\/science.287.5461.2196","volume":"287","author":"E.W. Myers","year":"2000","unstructured":"Myers, E.W. and Celera Genomics Corporation: The whole-genome assembly of drosophila. Science\u00a0287, 2196\u20132204 (2000)","journal-title":"Science"},{"key":"41_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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\u2013632. Springer, Heidelberg (2003)"},{"key":"41_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BFb0054337","volume-title":"LATIN\u201998: Theoretical Informatics","author":"M.F. Sagot","year":"1998","unstructured":"Sagot, M.F.: Spelling approximate repeated or common motifs using a suffix tree. In: Lucchesi, C.L., Moura, A.V. (eds.) LATIN 1998. LNCS, vol.\u00a01380, pp. 111\u2013127. Springer, Heidelberg (1998)"},{"key":"41_CR13","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1137\/0217079","volume":"17","author":"B. Schieber","year":"1988","unstructured":"Schieber, B., Vishkin, U.: On Finding lowest common ancestors:simplifications and parallelization. SIAM Journal on Computing\u00a017, 1253\u20131262 (1988)","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"41_CR14","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/0020-0190(77)90031-X","volume":"6","author":"P. Emde Boas van","year":"1977","unstructured":"van Emde Boas, P.: Preserving order in a forest in less than logarithmic time and linear space. Information Processing Letters\u00a06(3), 80\u201382 (1977)","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30213-1_41.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:56:23Z","timestamp":1620014183000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30213-1_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540232100","9783540302131"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30213-1_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}