{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,19]],"date-time":"2025-04-19T11:10:20Z","timestamp":1745061020524},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405610"},{"type":"electronic","value":"9783540450894"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45089-0_27","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T03:27:35Z","timestamp":1193455655000},"page":"294-296","source":"Crossref","is-referenced-by-count":3,"title":["The Longest Common Subsequence Problem A Finite Automata Approach"],"prefix":"10.1007","author":[{"given":"Bo\u0159ivoj","family":"Melichar","sequence":"first","affiliation":[]},{"given":"Tom\u00e1\u0161","family":"Polcar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,6,24]]},"reference":[{"key":"27_CR1","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1145\/360825.360861","volume":"18","author":"D. S. Hirschberg","year":"1975","unstructured":"Hirschberg, D. S.: A linear space algorithm for computing maximal common subsequences. Commun. ACM 18 (1975) 341\u2013343","journal-title":"Commun. ACM"},{"key":"27_CR2","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1145\/359581.359603","volume":"20","author":"J.W. Hunt","year":"1977","unstructured":"Hunt, J.W., Szymanski, T.G.: A fast algorithm for computing longest common subsequences. Commun. ACM 20 (1977) 350\u2013353","journal-title":"Commun. ACM"},{"key":"27_CR3","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1051\/ita\/1986200404411","volume":"20","author":"J. J. H\u00e9brard","year":"1986","unstructured":"H\u00e9brard, J. J., Crochemore, M.: Calcul de la distance par les sous-mots. RAIRO Inform. Th\u00e9or. Appl. 20 (1986) 441\u2013456","journal-title":"RAIRO Inform. Th\u00e9or. Appl."},{"key":"27_CR4","series-title":"Collaborative Report","first-page":"107","volume-title":"Proceedings of the Prague Stringology Club Workshop\u2019 98","author":"Z. Tron\u00ed\u010dek","year":"1998","unstructured":"Tron\u00ed\u010dek, Z., Melichar, B.: Directed acyclic subsequence graph. In Holub, J., \u0160im\u00e1nek, M., eds.: Proceedings of the Prague Stringology Club Workshop\u2019 98, Czech Technical University, Praque, Czech Republic (1998) 107\u2013118 Collaborative Report DC-98-06."},{"key":"27_CR5","unstructured":"Crochemore, M., Tron\u00ed\u010dek, Z.: Directed acyclic subsequnce graph for multiple texts. Repport I.G.M. 99-13, Universit\u00e9 de Marne-la-Vall\u00e9e (1999)"}],"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-45089-0_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T11:05:10Z","timestamp":1551006310000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45089-0_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405610","9783540450894"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/3-540-45089-0_27","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}