{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:27:15Z","timestamp":1725460035442},"publisher-location":"Boston","reference-count":18,"publisher":"Kluwer Academic Publishers","isbn-type":[{"type":"print","value":"1402081405"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/1-4020-8141-3_22","type":"book-chapter","created":{"date-parts":[[2006,2,21]],"date-time":"2006-02-21T10:15:11Z","timestamp":1140516911000},"page":"265-278","source":"Crossref","is-referenced-by-count":6,"title":["Efficient Algorithms for Handling Molecular Weighted Sequences"],"prefix":"10.1007","author":[{"given":"Costas S.","family":"Iliopoulos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christos","family":"Makris","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yannis","family":"Panagis","sequence":"additional","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"}]}],"member":"297","reference":[{"key":"22_CR1","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0020-0190(91)90056-N","volume":"39","author":"A. Apostolico","year":"1991","unstructured":"Apostolico, A., Farach, M., Iliopoulos, C.S.: Optimal superprimitivity testing for strings, Information Processing Letters, 39, (1991) 17\u201320.","journal-title":"Information Processing Letters"},{"key":"22_CR2","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0304-3975(83)90109-3","volume":"22","author":"A. Apostolico","year":"1983","unstructured":"Apostolico, A., Preparata, F.P.,: Optimal off-line detection of repetitions in a string. Theoretical Computer Science, Vol. 22. (1983) 297\u2013315.","journal-title":"Theoretical Computer Science"},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"Brodal G.S., Lyngso R.B., Storm Pedersen C.N., and Stoye J.: Finding Maximal Pairs with Bounded Gap. In Proc. 10th CPM, pp. 134\u2013149, (1999).","DOI":"10.1007\/3-540-48452-3_11"},{"key":"22_CR4","doi-asserted-by":"crossref","first-page":"2185","DOI":"10.1126\/science.287.5461.2185","volume":"287","author":"C. Genomics","year":"2000","unstructured":"Celera Genomics: The Genome Sequence of Drosophila melanogaster. Science, Vol. 287. (2000) 2185\u20132195","journal-title":"Science"},{"key":"22_CR5","doi-asserted-by":"crossref","first-page":"1304","DOI":"10.1126\/science.1058040","volume":"291","author":"C. Genomics","year":"2001","unstructured":"Celera Genomics: The Sequence of the Human Genome. Science, Vol. 291, (2001) 1304\u20131351.","journal-title":"Science"},{"key":"22_CR6","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/0020-0190(81)90024-7","volume":"12","author":"M. Crochemore","year":"1981","unstructured":"Crochemore, M.: An Optimal Algorithm for Computing the Repetitions in a Word. Inf. Proc. Lett., Vol. 12. (1981) 244\u2013250.","journal-title":"Inf. Proc. Lett."},{"key":"22_CR7","doi-asserted-by":"publisher","first-page":"3608","DOI":"10.1093\/nar\/gkg548","volume":"31","author":"G. Grillo","year":"2003","unstructured":"G. Grillo, F. Licciuli, S. Liuni, E. Sbisa, G. Pesole PatSearch: a program for the detection of patterns and structural motifs in nucleotide sequences. Nucleic Acids Res.\n                  31 (2003), 3608\u20133612.","journal-title":"Nucleic Acids Res."},{"key":"22_CR8","doi-asserted-by":"crossref","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":"22_CR9","unstructured":"Iliopoulos, C., Makris, Ch, Panagis, I., Perdikuri, K., Theodoridis, E., Tsakalidis, A.: Computing the Repetitions in a Weighted Sequence using Weighted Suffix Trees, In European Conference on Computational Biology (ECCB0 2003), Posters\u2019 Track."},{"key":"22_CR10","unstructured":"Iliopoulos, C., Mouchard, L., Perdikuri, K., Tsakalidis, A.,: Computing the repetitions in a weighted sequence, Proceedings of the Prague Stringology Conference (PSC) 2003), 91\u201398."},{"key":"22_CR11","doi-asserted-by":"crossref","unstructured":"Kolpakov, R., Kucherov, G.,: Finding maximal repetitions in a word in linear time. In Proc. FOCS99, pp. 596\u2013604, (1999).","DOI":"10.1109\/SFFCS.1999.814634"},{"key":"22_CR12","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1093\/bioinformatics\/15.5.426","volume":"15","author":"S. Kurtz","year":"1999","unstructured":"Kurtz, S., Schleiermacher, C.,: REPuter: fast computation of maximal repeats in complete genomes. Bioinformatics, Vol. 15, (1999) 426\u2013427.","journal-title":"Bioinformatics"},{"key":"22_CR13","first-page":"11772","volume":"99","author":"H. Li","year":"2002","unstructured":"H. Li, V. Rhodius, C. Gross, E. Siggia Identification of the binding sites of regulatory proteins in bacterial genomes Genetics\n                  99 (2002), 11772\u201311777.","journal-title":"Genetics"},{"key":"22_CR14","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1145\/321941.321946","volume":"23","author":"E. McCreight","year":"1976","unstructured":"McCreight, E., M.,: A space-economical suffix tree construction algorithm. J. of the ACM, Vol. 23, (1976) 262\u2013272.","journal-title":"J. of the ACM"},{"key":"22_CR15","unstructured":"Stoye, J., Gusfield, D.,: Simple and flexible detection of contiguous repeats using a suffix tree. In Proc. 9th CPM, Vol. 1448 of LNCS, (1998) 140\u2013152."},{"key":"22_CR16","first-page":"202","volume":"4","author":"T. Tsunoda","year":"1999","unstructured":"Tsunoda, T., Fukagawa, M., Takagi, T.,: Time and memory efficient algorithm for extracting palindromic and repetitive subsequences in nucleic acid sequences. Pacific Symposium on Biocomputing, Vol. 4, (1999) 202\u2013213.","journal-title":"Pacific Symposium on Biocomputing"},{"key":"22_CR17","doi-asserted-by":"crossref","unstructured":"Ukkonen, E.,:On-line construction of suffix trees. Algorithmica, Vol. 14, (1995), 249\u2013260.","DOI":"10.1007\/BF01206331"},{"key":"22_CR18","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BF01683268","volume":"10","author":"P. Emde Boas van","year":"1977","unstructured":"van Emde Boas P., R. Kaas and E. Zijlstra, Design and implementation of an efficient priority queue. Mathematical Systems Theory, 10, pp. 99\u2013127, (1977)","journal-title":"Mathematical Systems Theory"}],"container-title":["IFIP International Federation for Information Processing","Exploring New Frontiers of Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/1-4020-8141-3_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T16:28:12Z","timestamp":1619540892000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/1-4020-8141-3_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["1402081405"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/1-4020-8141-3_22","relation":{},"subject":[]}}