{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:47:41Z","timestamp":1725486461958},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540413486"},{"type":"electronic","value":"9783540444114"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44411-4_19","type":"book-chapter","created":{"date-parts":[[2007,6,18]],"date-time":"2007-06-18T22:52:31Z","timestamp":1182207151000},"page":"307-318","source":"Crossref","is-referenced-by-count":0,"title":["Fast Evolutionary Chains"],"prefix":"10.1007","author":[{"given":"Maxime","family":"Crochemore","sequence":"first","affiliation":[]},{"given":"Costas S.","family":"Iliopoulos","sequence":"additional","affiliation":[]},{"given":"Yoan J.","family":"Pinzon","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,1,22]]},"reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0304-3975(83)90109-3","volume":"22","author":"A. Apostolico","year":"1983","unstructured":"A. Apostolico and F. P. Preparata, Optimal Off-line Detection of Repetitions in a String, Theoretical Computer Science, 22 3, pp. 297\u2013315 (1983). 309","journal-title":"Theoretical Computer Science"},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1080\/09298219608570706","volume":"25","author":"E. Cambouropoulos","year":"1996","unstructured":"E. Cambouropoulos, A General Pitch Interval Representation: Theory and Applications, Journal of New Music Research 25, pp. 231\u2013251 (1996). 307","journal-title":"Journal of New Music Research"},{"key":"19_CR3","unstructured":"E. Cambouropoulos, T. Crawford and C. S. Iliopoulos, (1999) Pattern Processing in Melodic Sequences: Challenges, Caveats and Prospects. In Proceedings of the AISB\u201999 Convention (Artificial Intelligence and Simulation of Behaviour), Edinburgh, U.K., pp. 42\u201347 (1999). 307"},{"key":"19_CR4","first-page":"73","volume":"11","author":"T. Crawford","year":"1998","unstructured":"T. Crawford, C. S. Iliopoulos and R. Raman, String Matching Techniques for Musical Similarity and Melodic Recognition, Computing in Musicology, Vol 11, pp. 73\u2013100 (1998). 307","journal-title":"Computing in Musicology"},{"key":"19_CR5","unstructured":"T. Crawford, C. S. Iliopoulos, R. Winder and H. Yu, Approximate musical evolution, in the Proceedings of the 1999 Artificial Intelligence and Simulation of Behaviour Symposium (AISB\u201999), G. Wiggins (ed), The Society for the Study of Artificial Intelligence and Simulation of Behaviour, Edinburgh, pp. 76\u201381 (1999). 317"},{"key":"19_CR6","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/0020-0190(81)90024-7","volume":"12","author":"M. Crochemore","year":"1981","unstructured":"M. Crochemore, An optimal algorithm for computing the repetitions in a word, Information Processing Letters 12, pp. 244\u2013250 (1981). 309","journal-title":"Information Processing Letters"},{"key":"19_CR7","unstructured":"M. Crochemore, C. S. Iliopoulos and H. Yu, Algorithms for computing evolutionary chains in molecular and musical sequences, Proceedings of the 9-th Australasian Workshop on Combinatorial Algorithms Vol 6, pp. 172\u2013185 (1998). 317"},{"key":"19_CR8","series-title":"Lect Notes Comput Sci","first-page":"262","volume-title":"O(n log n) algorithm for computing all maximal quasiperiodicities in strings","author":"C. S. Iliopoulos","year":"1999","unstructured":"C. S. Iliopoulos and L. Mouchard, An O(n log n) algorithm for computing all maximal quasiperiodicities in strings, Proceedings of CATS\u201999: \u201dComputing: Australasian Theory Symposium\u201c, Auckland, New Zealand, Lecture Notes in Computer Science, Springer Verlag, Vol 21 3, pp. 262\u2013272 (1999). 309"},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/BF01955677","volume":"16","author":"C. S. Iliopoulos","year":"1996","unstructured":"C. S. Iliopoulos, D. W. G. Moore and K. Park, Covering a string, Algorithmica 16, pp. 288\u2013297 (1996). 309","journal-title":"Algorithmica"},{"key":"19_CR10","unstructured":"C. S. Iliopoulos and Y. J. Pinzon, The Max-Shift Algorithm, submitted. 312"},{"key":"19_CR11","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/0196-6774(89)90010-2","volume":"10","author":"G.M. Landau","year":"1989","unstructured":"G.M. Landau and U. Vishkin, Fast parallel and serial approximate string matching, in Journal of Algorithms 10, pp. 157\u2013169 (1989). 309","journal-title":"Journal of Algorithms"},{"key":"19_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1007\/BFb0029801","volume-title":"An algorithm for approximate tandem repeats","author":"G. M. Landau","year":"1993","unstructured":"G. M. Landau and J. P. Schmidt, An algorithm for approximate tandem repeats, in Proc. Fourth Symposium on Combinatorial Pattern Matching, Springer-Verlag Lecture Notes in Computer Science 648, pp. 120\u2013133 (1993). 309"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"G. M. Landau and U. Vishkin, Introducing efficient parallelism into approximate string matching and a new serial algorithm, in Proc. Annual ACM Symposium on Theory of Computing, ACM Press, pp. 220\u2013230 (1986). 311, 312","DOI":"10.1145\/12130.12152"},{"key":"19_CR14","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1016\/0196-6774(84)90021-X","volume":"5","author":"G. Main","year":"1984","unstructured":"G. Main and R. Lorentz, An O(n log n) algorithm for finding all repetitions in a string, Journal of Algorithms 5, pp. 422\u2013432 (1984). 309","journal-title":"Journal of Algorithms"},{"key":"19_CR15","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1145\/316542.316550","volume":"46","author":"E. W. Myers","year":"1999","unstructured":"E. W. Myers, A Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic Progamming, in Journal of the ACM 46 3, pp. 395\u2013415 (1999). 311","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2000: Theory and Practice of Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44411-4_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T11:18:50Z","timestamp":1550402330000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44411-4_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540413486","9783540444114"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-44411-4_19","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}