{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:31:06Z","timestamp":1725579066835},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642199523"},{"type":"electronic","value":"9783642199530"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-19953-0_1","type":"book-chapter","created":{"date-parts":[[2011,3,17]],"date-time":"2011-03-17T04:46:37Z","timestamp":1300337197000},"page":"3-12","source":"Crossref","is-referenced-by-count":0,"title":["Algorithm to Determine Longest Common Subsequences of Two Finite Languages"],"prefix":"10.1007","author":[{"given":"Dang Quyet","family":"Thang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-73235-5","volume-title":"Rational Series and Their Languages","author":"J. Berstel","year":"1988","unstructured":"Berstel, J., Reutenauer, C.: Rational Series and Their Languages. Springer, Berlin (1988)"},{"issue":"6","key":"1_CR2","doi-asserted-by":"publisher","first-page":"957","DOI":"10.1142\/S0129054103002114","volume":"14","author":"M. Mohri","year":"2003","unstructured":"Mohri, M.: Edit-Distance of Weighted Automata: General Definitions and Algorithms. International Journal of Foundations of Computer Science\u00a014(6), 957\u2013982 (2003)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"1_CR3","series-title":"Springer Handbook of Speech Processing","volume-title":"Speech Recognition with Weighted Finite-State Transducers","author":"M. Mohri","year":"2007","unstructured":"Mohri, M., Pereira, F., Riley, M.: Speech Recognition with Weighted Finite-State Transducers. Springer Handbook of Speech Processing. Springer, Heidelberg (2007)"},{"key":"1_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-6264-0","volume-title":"Automata-Theoretic Aspects of Formal Power Series","author":"A. Salomaa","year":"1978","unstructured":"Salomaa, A., Soittola, M.: Automata-Theoretic Aspects of Formal Power Series. Springer, New York (1978)"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Sch\u00fctzenberger, M.P.: On the definition of a family of automata. Information and Control\u00a04 (1961)","DOI":"10.1016\/S0019-9958(61)80020-X"},{"key":"1_CR6","unstructured":"Trung huy, P., Khang, N.Q.: Fuzy automaton and application to the problem of determining the longest common subsequence (in Vietnamese). In: The sixth National Conference of Maths, Vietnam (2002)"},{"key":"1_CR7","volume-title":"Handbook of Theoretical Compter Science, ch. 5","author":"A.V. Aho","year":"1990","unstructured":"Aho, A.V.: Algorithms for Finding Patterns in String. In: Handbook of Theoretical Compter Science, ch. 5, vol.\u00a0A. Elsevier Sciencs Publisher BV, Amsterdam (1990)"},{"issue":"5","key":"1_CR8","doi-asserted-by":"publisher","first-page":"1122","DOI":"10.1137\/S009753979223842X","volume":"24","author":"T. Jiang","year":"1995","unstructured":"Jiang, T., Li, M.: On the approximation of shortest common supersequences and longest common subsequences. SIAM Journal of Computing\u00a024(5), 1122\u20131139 (1995)","journal-title":"SIAM Journal of Computing"},{"key":"1_CR9","volume-title":"Theory of Computing Systems","author":"C.S. Iliopoulos","year":"2008","unstructured":"Iliopoulos, C.S., Sohel Rahman, M.: A New Efficient Algorithm for Computing the Longest Common Subsequence. In: Theory of Computing Systems. Springer, New York (2008)"},{"issue":"1","key":"1_CR10","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. J. ACM\u00a021(1), 168\u2013173 (1974)","journal-title":"J. ACM"},{"key":"1_CR11","doi-asserted-by":"publisher","first-page":"4303","DOI":"10.1016\/j.tcs.2009.07.011","volume":"410","author":"S. Mozes","year":"2009","unstructured":"Mozes, S., Tsur, D., Weimann, O., Ziv-Ukelson, M.: Fast algorithms for computing tree LCS. Theoretical Computer Science\u00a0410, 4303\u20134314 (2009)","journal-title":"Theoretical Computer Science"},{"key":"1_CR12","unstructured":"Hirschberg, D.S.: An Information Theoretic Lower Bound for the Longest Common Subsequence Problem. Rice Technical Report No.7705 (1977)"},{"issue":"5","key":"1_CR13","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 subsequences. Commun. ACM\u00a020(5), 350\u2013353 (1977)","journal-title":"Commun. ACM"}],"container-title":["Studies in Computational Intelligence","New Challenges for Intelligent Information and Database Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19953-0_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:54:35Z","timestamp":1606186475000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19953-0_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642199523","9783642199530"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19953-0_1","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2011]]}}}