{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:51:53Z","timestamp":1725533513894},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642024405"},{"type":"electronic","value":"9783642024412"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02441-2_18","type":"book-chapter","created":{"date-parts":[[2009,6,17]],"date-time":"2009-06-17T09:19:32Z","timestamp":1245230372000},"page":"193-206","source":"Crossref","is-referenced-by-count":5,"title":["Periodic String Comparison"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Tiskin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"7","key":"18_CR1","doi-asserted-by":"publisher","first-page":"1025","DOI":"10.1016\/j.dam.2007.05.056","volume":"156","author":"C.E.R. Alves","year":"2008","unstructured":"Alves, C.E.R., C\u00e1ceres, E.N., Song, S.W.: An all-substrings common subsequence algorithm. Discrete Applied Mathematics\u00a0156(7), 1025\u20131035 (2008)","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"18_CR2","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1016\/j.dam.2004.04.009","volume":"146","author":"G. Benson","year":"2005","unstructured":"Benson, G.: Tandem cyclic alignment. Discrete Applied Mathematics\u00a0146(2), 124\u2013133 (2005)","journal-title":"Discrete Applied Mathematics"},{"key":"18_CR3","series-title":"Texts in Algorithmics","volume-title":"String Algorithmics","author":"M. Crochemore","year":"2004","unstructured":"Crochemore, M., Landau, G.M., Schieber, B., Ziv-Ukelson, M.: Re-use dynamic programming for sequence alignment: An algorithmic toolkit. In: String Algorithmics. Texts in Algorithmics, vol.\u00a02. College Publications, King\u2019s (2004)"},{"issue":"1","key":"18_CR4","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0020-0190(93)90245-5","volume":"45","author":"V.A. Fischetti","year":"1993","unstructured":"Fischetti, V.A., Landau, G.M., Sellers, P.H., Schmidt, J.P.: Identifying periodic occurrences of a template with applications to protein structure. Information Processing Letters\u00a045(1), 11\u201318 (1993)","journal-title":"Information Processing Letters"},{"key":"18_CR5","series-title":"Chapman and Hall\/CRC Computer and Information Science Series","first-page":"1","volume-title":"Handbook of Computational Molecular Biology","author":"B.N. Jackson","year":"2006","unstructured":"Jackson, B.N., Aluru, S.: Pairwise sequence alignment. In: Handbook of Computational Molecular Biology. Chapman and Hall\/CRC Computer and Information Science Series, ch.\u00a01, pp. 1\u20131 \u2013 1\u201331. Chapman and Hall\/CRC, Boca Raton (2006)"},{"key":"18_CR6","unstructured":"Landau, G.: Can DIST tables be merged in linear time? An open problem. In: Proceedings of the Prague Stringology Conference, p. 1. Czech Technical University in Prague (2006)"},{"issue":"7","key":"18_CR7","doi-asserted-by":"publisher","first-page":"1095","DOI":"10.1016\/j.jcss.2007.03.004","volume":"73","author":"G.M. Landau","year":"2007","unstructured":"Landau, G.M., Myers, E., Ziv-Ukelson, M.: Two algorithms for LCS consecutive suffix alignment. Journal of Computer and System Sciences\u00a073(7), 1095\u20131117 (2007)","journal-title":"Journal of Computer and System Sciences"},{"issue":"2","key":"18_CR8","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1006\/jagm.2001.1191","volume":"41","author":"G.M. Landau","year":"2001","unstructured":"Landau, G.M., Ziv-Ukelson, M.: On the common substring alignment problem. Journal of Algorithms\u00a041(2), 338\u2013359 (2001)","journal-title":"Journal of Algorithms"},{"key":"18_CR9","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/0022-0000(80)90002-1","volume":"20","author":"W.J. Masek","year":"1980","unstructured":"Masek, W.J., Paterson, M.S.: A faster algorithm computing string edit distances. Journal of Computer and System Sciences\u00a020, 18\u201331 (1980)","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"18_CR10","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/BF02458834","volume":"51","author":"E.W. Myers","year":"1989","unstructured":"Myers, E.W., Miller, W.: Approximate matching of regular expressions. Bulletin of Mathematical Biology\u00a051(1), 5\u201337 (1989)","journal-title":"Bulletin of Mathematical Biology"},{"issue":"3","key":"18_CR11","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1016\/0022-2836(70)90057-4","volume":"48","author":"S.B. Needleman","year":"1970","unstructured":"Needleman, S.B., Wunsch, C.D.: A general method applicable to the search for similarities in the amino acid sequence of two proteins. Journal of Molecular Biology\u00a048(3), 443\u2013453 (1970)","journal-title":"Journal of Molecular Biology"},{"issue":"4","key":"18_CR12","doi-asserted-by":"publisher","first-page":"972","DOI":"10.1137\/S0097539795288489","volume":"27","author":"J.P. Schmidt","year":"1998","unstructured":"Schmidt, J.P.: All highest scoring paths in weighted grid graphs and their application to finding all approximate repeats in strings. SIAM Journal on Computing\u00a027(4), 972\u2013992 (1998)","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"18_CR13","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1016\/0196-6774(80)90016-4","volume":"1","author":"P.H. Sellers","year":"1980","unstructured":"Sellers, P.H.: The theory and computation of evolutionary distances: Pattern recognition. Journal of Algorithms\u00a01(4), 359\u2013373 (1980)","journal-title":"Journal of Algorithms"},{"issue":"4","key":"18_CR14","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1016\/j.jda.2008.07.001","volume":"6","author":"A. Tiskin","year":"2008","unstructured":"Tiskin, A.: Semi-local longest common subsequences in subquadratic time. Journal of Discrete Algorithms\u00a06(4), 570\u2013581 (2008)","journal-title":"Journal of Discrete Algorithms"},{"issue":"4","key":"18_CR15","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1007\/s11786-007-0033-3","volume":"1","author":"A. Tiskin","year":"2008","unstructured":"Tiskin, A.: Semi-local string comparison: Algorithmic techniques and applications. Mathematics in Computer Science\u00a01(4), 571\u2013603 (2008)","journal-title":"Mathematics in Computer Science"},{"key":"18_CR16","unstructured":"Tiskin, A.: Semi-local string comparison: Algorithmic techniques and applications. Technical Report 0707.3619, arXiv (2009)"},{"issue":"1","key":"18_CR17","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1145\/321796.321811","volume":"21","author":"R.A. Wagner","year":"1974","unstructured":"Wagner, R.A., Fischer, M.J.: The string-to-string correction problem. Journal of the ACM\u00a021(1), 168\u2013173 (1974)","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02441-2_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,8]],"date-time":"2019-03-08T16:08:01Z","timestamp":1552061281000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02441-2_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642024405","9783642024412"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02441-2_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}