{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:31:37Z","timestamp":1759638697541},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642143540"},{"type":"electronic","value":"9783642143557"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14355-7_28","type":"book-chapter","created":{"date-parts":[[2010,6,23]],"date-time":"2010-06-23T13:34:40Z","timestamp":1277300080000},"page":"271-280","source":"Crossref","is-referenced-by-count":5,"title":["Varieties of Regularities in Weighted Sequences"],"prefix":"10.1007","author":[{"given":"Hui","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Qing","family":"Guo","sequence":"additional","affiliation":[]},{"given":"Costas S.","family":"Iliopoulos","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"28_CR1","first-page":"77","volume":"1","author":"G.S. Brodal","year":"2000","unstructured":"Brodal, G.S., Lyngs\u00f8, R.B., Pedersen, C.N.S., Stoye, J.: Finding Maximal Pairs with Bounded Gap. Journal of Discrete Algorithms, Special Issue of Matching Patterns\u00a01(1), 77\u2013104 (2000)","journal-title":"Journal of Discrete Algorithms, Special Issue of Matching Patterns"},{"issue":"6","key":"28_CR2","doi-asserted-by":"publisher","first-page":"1214","DOI":"10.1089\/cmb.2006.13.1214","volume":"13","author":"M. Christodoulakis","year":"2006","unstructured":"Christodoulakis, M., Iliopoulos, C.S., Mouchard, L., Perdikuri, K., Tsakalidis, A., Tsichlas, K.: Computation of repetitions and regularities on biological weighted sequences. Journal of Computational Biology\u00a013(6), 1214\u20131231 (2006)","journal-title":"Journal of Computational Biology"},{"key":"28_CR3","series-title":"Lecture Series on Computer and Computational Sciences","first-page":"701","volume-title":"Proc. of the International Conference of Computational Methods in Science and Engineering","author":"M. Christodoulakis","year":"2004","unstructured":"Christodoulakis, M., Iliopoulos, C.S., Perdikuri, K., Tsichlas, K.: Searching the regularities in weighted sequences. In: Proc. of the International Conference of Computational Methods in Science and Engineering. Lecture Series on Computer and Computational Sciences, pp. 701\u2013704. Springer, Heidelberg (2004)"},{"issue":"5","key":"28_CR4","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. Information Processing Letter\u00a012(5), 244\u2013250 (1981)","journal-title":"Information Processing Letter"},{"issue":"4","key":"28_CR5","first-page":"579","volume":"8","author":"F. Fran\u00eak","year":"2003","unstructured":"Fran\u00eak, F., Smyth, W.F., Tang, Y.: Computing All Repeats Using Suffix Arrays. Journal of Automata, Languages and Combinatorics\u00a08(4), 579\u2013591 (2003)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"issue":"19","key":"28_CR6","doi-asserted-by":"publisher","first-page":"3957","DOI":"10.1016\/j.ins.2007.02.020","volume":"177","author":"Q. Guo","year":"2007","unstructured":"Guo, Q., Zhang, H., Iliopoulos, C.S.: Computing the \u03bb-covers of a string. Information Sciences\u00a0177(19), 3957\u20133967 (2007)","journal-title":"Information Sciences"},{"key":"28_CR7","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, Cambridge (1997)"},{"key":"28_CR8","first-page":"265","volume":"147","author":"C.S. Iliopoulos","year":"2004","unstructured":"Iliopoulos, C.S., Makris, C., Panagis, Y., Perdikuri, K., Theodoridis, E., Tsakalidis, A.: Efficient Algorithms for Handling Molecular Weighted Sequences. IFIP Theoretical Computer Science\u00a0147, 265\u2013278 (2004)","journal-title":"IFIP Theoretical Computer Science"},{"key":"28_CR9","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/BF01955677","volume":"16","author":"C.S. Iliopoulos","year":"1996","unstructured":"Iliopoulos, C.S., Moore, D.W.G., Park, K.: Covering a String. Algorithmica\u00a016, 288\u2013297 (1996)","journal-title":"Algorithmica"},{"key":"28_CR10","unstructured":"Iliopoulos, C.S., Mouchard, L., Perdikuri, K., Tsakalidis, A.: Computing the repetitions in a weighted sequence. In: Proc. of the 8th Prague Stringology Conference (PSC 2003), pp. 91\u201398 (2003)"},{"key":"28_CR11","unstructured":"Iliopoulos, C.S., Perdikuri, K., Zhang, H.: Computing the regularities in biological weighted sequence. In: String Algorithmics. NATO Book series, pp. 109\u2013128 (2004)"},{"issue":"1","key":"28_CR12","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s00453-001-0062-2","volume":"32","author":"Y. Li","year":"2002","unstructured":"Li, Y., Smyth, W.F.: Computing the Cover Array in Linear Time. Algorithmica\u00a032(1), 95\u2013106 (2002)","journal-title":"Algorithmica"},{"key":"28_CR13","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/BF02104737","volume":"20","author":"S. Ohno","year":"1984","unstructured":"Ohno, S.: Repeats of base oligomers as the primordial coding sequences of the primeval earth and their vestiges in modern genes. Journal of Molecular Evolution\u00a020, 313\u2013321 (1984)","journal-title":"Journal of Molecular Evolution"},{"key":"28_CR14","first-page":"33","volume":"84","author":"H. Zhang","year":"2008","unstructured":"Zhang, H., Guo, Q., Iliopoulos, C.S.: Algorithms for Computing the \u03bb-regularities in Strings. Fundamenta Informaticae\u00a084, 33\u201349 (2008)","journal-title":"Fundamenta Informaticae"},{"key":"28_CR15","unstructured":"Zhang, H., Guo, Q., Iliopoulos, C.S.: Loose and strict repeats in weighted sequences. In: Proc. of the International Conference on Intelligent Computing, ICIC 2009 (accepted 2009)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14355-7_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T12:25:12Z","timestamp":1619785512000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14355-7_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642143540","9783642143557"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14355-7_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}