{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T21:40:04Z","timestamp":1775079604486,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540403913","type":"print"},{"value":"9783540449775","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44977-9_28","type":"book-chapter","created":{"date-parts":[[2007,10,16]],"date-time":"2007-10-16T10:20:28Z","timestamp":1192530028000},"page":"270-275","source":"Crossref","is-referenced-by-count":13,"title":["Common Subsequence Automaton"],"prefix":"10.1007","author":[{"given":"Zden\u00eak","family":"Troni\u0109ek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,24]]},"reference":[{"issue":"2","key":"28_CR1","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/0304-3975(91)90358-9","volume":"78","author":"R. A. Baeza-Yates","year":"1991","unstructured":"R. A. Baeza-Yates. Searching subsequences. Theor. Comput. Sci., 78(2):363\u2013376, 1991.","journal-title":"Theor. Comput. Sci."},{"key":"28_CR2","unstructured":"M. Crochemore and Z. Tron\u00ed\u0109ek. Directed acyclic subsequence graph for multiple texts. Rapport I.G.M. 99-13, Universit\u00e9 de Marne-la-Vall\u00e9e, 1999."},{"key":"28_CR3","doi-asserted-by":"crossref","unstructured":"M. Hirao, H. Hoshino, A. Shinohara, M. Takeda, and S. Arikawa. A practical algorithm to find best subsequence patterns. In Proceedings of the 3rd International Conference on Discovery Science, volume 1967, pages 141\u2013154. Springer-Verlag,Berlin, 2000.","DOI":"10.1007\/3-540-44418-1_12"},{"issue":"6","key":"28_CR4","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1145\/360825.360861","volume":"18","author":"D. S. Hirschberg","year":"1975","unstructured":"D. S. Hirschberg. A linear space algorithm for computing maximal common subsequences. Commun. ACM, 18(6):341\u2013343, 1975.","journal-title":"Commun. ACM"},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"H. Hoshino, A. Shinohara, M. Takeda, and S. Arikawa. Online construction of subsequence automata for multiple texts. In Proceedings of the String Processing and Information Retrieval: A South American Symposium 2000, La Coru\u00f1a, Spain, 2000. IEEE Computer Society Press.","DOI":"10.1109\/SPIRE.2000.878190"},{"key":"28_CR6","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/BF01934514","volume":"24","author":"W. J. Hsu","year":"1984","unstructured":"W. J. Hsu and M. W. Du. Computing a longest common subsequence for a set of strings. BIT, 24:45\u201359, 1984.","journal-title":"BIT"},{"issue":"5","key":"28_CR7","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1145\/359581.359603","volume":"20","author":"J. W. Hunt","year":"1977","unstructured":"J. W. Hunt and T. G. Szymanski. A fast algorithm for computing longest common subsequences. Commun. ACM, 20(5):350\u2013353, 1977.","journal-title":"Commun. ACM"},{"key":"28_CR8","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/BF01934067","volume":"21","author":"S. Y. Itoga","year":"1981","unstructured":"S. Y. Itoga. The string merging problem. BIT, 21:20\u201330, 1981.","journal-title":"BIT"},{"issue":"2","key":"28_CR9","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1145\/322063.322075","volume":"25","author":"D. Maier","year":"1978","unstructured":"D. Maier. The complexity of some problems on subsequences and supersequences. J. Assoc. Comput. Mach., 25(2):322\u2013336, 1978.","journal-title":"J. Assoc. Comput. Mach."},{"issue":"1","key":"28_CR10","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/0022-0000(80)90002-1","volume":"20","author":"W. J. Masek","year":"1980","unstructured":"W. J. Masek and M. S. Paterson. A faster algorithm for computing string edit distances. J. Comput. Syst. Sci., 20(1):18\u201331, 1980.","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44977-9_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T02:31:14Z","timestamp":1550975474000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44977-9_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540403913","9783540449775"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-44977-9_28","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2003]]}}}