{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,29]],"date-time":"2026-03-29T11:18:02Z","timestamp":1774783082871,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540422716","type":"print"},{"value":"9783540481942","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-48194-x_10","type":"book-chapter","created":{"date-parts":[[2009,2,3]],"date-time":"2009-02-03T19:24:31Z","timestamp":1233689071000},"page":"118-130","source":"Crossref","is-referenced-by-count":4,"title":["Tandem Cyclic Alignment"],"prefix":"10.1007","author":[{"given":"Gary","family":"Benson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,6,13]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"968","DOI":"10.1137\/0219066","volume":"19","author":"A. Apostolico","year":"1990","unstructured":"A. Apostolico, M.J. Atallah, L.L. Larmore, and S. Mcfaddin. Efficient parallel algorithms for string editing and related problems. SIAM J. Comput., 19:968\u2013988, 1990.","journal-title":"SIAM J. Comput"},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1093\/nar\/27.2.573","volume":"27","author":"G. Benson","year":"1999","unstructured":"G. Benson. Tandem repeats finder: a program to analyze DNA sequences. Nucleic Acids Research, 27:573\u2013580, 1999.","journal-title":"Nucleic Acids Research"},{"key":"10_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/3-540-56024-6_9","volume-title":"Proc. 3rd annual Symp. On Combinatorial Pattern Matching","author":"V. Fischetti","year":"1992","unstructured":"V. Fischetti, G. Landau, J. Schmidt, and P. Sellers. Identifying periodic occurrences of a template with applications to a protein structure. In A. Apostolico, M. Crochemore, Z. Galil, and U. Manber, editors, Proc. 3rd annual Symp. On Combinatorial Pattern Matching, Lecture Notes in Computer Science, volume 644, pages 111\u2013120. Springer-Verlag, 1992."},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1145\/359842.359846","volume":"20","author":"H. Fuchs","year":"1977","unstructured":"H. Fuchs, Z. Kedem, and S. Uselton. Optimal surface reconstruction from planar contours. CACM, 20:693\u2013702, 1977.","journal-title":"CACM"},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1137\/S0097539794264810","volume":"27","author":"G.M. Landau","year":"1998","unstructured":"G.M. Landau, E.W. Myers, and J.P. Schmidt. Incremental string comparison. SIAM J. Comput., 27:7\u201382, 1998.","journal-title":"SIAM J. Comput"},{"key":"10_CR6","first-page":"707","volume":"10","author":"V.I. Levenshtein","year":"1966","unstructured":"V.I. Levenshtein. Binary codes capable of correcting deletions, insertions and reversals. Soviet Phys. Dokl., 10:707\u2013710, 1966.","journal-title":"Soviet Phys. Dokl"},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0020-0190(90)90109-B","volume":"35","author":"M. Maes","year":"1990","unstructured":"M. Maes. On a cyclic string-to-string correction problem. Information Processing Letters, 35:73\u201378, 1990.","journal-title":"Information Processing Letters"},{"key":"10_CR8","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/BF02458834","volume":"51","author":"W. Miller","year":"1989","unstructured":"W. Miller and E. Myers. Approximate matching of regular expressions. Bulletin of Mathematical Biology, 51:5\u201337, 1989.","journal-title":"Bulletin of Mathematical Biology"},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"972","DOI":"10.1137\/S0097539795288489","volume":"27","author":"J. Schmidt","year":"1998","unstructured":"J. Schmidt. All shortest paths in weighted grid graphs and its application to finding all aproximate repeats in strings. SIAM J. Comput., 27:972\u2013992, 1998.","journal-title":"SIAM J. Comput"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48194-X_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,23]],"date-time":"2019-02-23T16:38:38Z","timestamp":1550939918000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48194-X_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540422716","9783540481942"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-48194-x_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001]]}}}