{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T19:00:00Z","timestamp":1767034800927},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540734369"},{"type":"electronic","value":"9783540734376"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73437-6_27","type":"book-chapter","created":{"date-parts":[[2007,8,13]],"date-time":"2007-08-13T13:36:44Z","timestamp":1187012204000},"page":"265-273","source":"Crossref","is-referenced-by-count":6,"title":["Algorithms for Computing the Longest Parameterized Common Subsequence"],"prefix":"10.1007","author":[{"given":"Costas S.","family":"Iliopoulos","sequence":"first","affiliation":[]},{"given":"Marcin","family":"Kubica","sequence":"additional","affiliation":[]},{"given":"M. Sohel","family":"Rahman","sequence":"additional","affiliation":[]},{"given":"Tomasz","family":"Wale\u0144","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","first-page":"1209","volume":"11","author":"V.L. Arlazarov","year":"1975","unstructured":"Arlazarov, V.L., Dinic, E.A., Kronrod, M.A., Faradzev, I.A.: On economic construction of the transitive closure of a directed graph (english translation). Soviet Math. Dokl.\u00a011, 1209\u20131210 (1975)","journal-title":"Soviet Math. Dokl."},{"key":"27_CR2","unstructured":"Baker, B.S.: Parameterized diff. In: Symposium of Discrete Algorithms (SODA), pp. 854\u2013855 (1999)"},{"issue":"2","key":"27_CR3","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1006\/jagm.2002.1214","volume":"42","author":"B.S. Baker","year":"2002","unstructured":"Baker, B.S., Giancarlo, R.: Sparse dynamic programming for longest common subsequence from fragments. Journal of Algorithms\u00a042(2), 231\u2013254 (2002)","journal-title":"Journal of Algorithms"},{"key":"27_CR4","first-page":"39","volume-title":"String Processing and Information Retrieval (SPIRE)","author":"L. Bergroth","year":"2000","unstructured":"Bergroth, L., Hakonen, H., Raita, T.: A survey of longest common subsequence algorithms. In: String Processing and Information Retrieval (SPIRE), pp. 39\u201348. IEEE Computer Society, Los Alamitos (2000)"},{"key":"27_CR5","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to algorithms. MIT Press, McGraw Hill, Cambridge (1992)"},{"key":"27_CR6","unstructured":"Crochemore, M., Landau, G.M., Ziv-Ukelson, M.: A sub-quadratic sequence alignment algorithm for unrestricted cost matrices. In: Symposium of Discrete Algorithms (SODA), pp. 679\u2013688 (2002)"},{"key":"27_CR7","first-page":"263","volume":"61","author":"F. Hadlock","year":"1988","unstructured":"Hadlock, F.: Minimum detour methods for string or sequence comparison. Congressus Numerantium\u00a061, 263\u2013274 (1988)","journal-title":"Congressus Numerantium"},{"issue":"4","key":"27_CR8","doi-asserted-by":"publisher","first-page":"664","DOI":"10.1145\/322033.322044","volume":"24","author":"D.S. Hirschberg","year":"1977","unstructured":"Hirschberg, D.S.: Algorithms for the longest common subsequence problem. Journal of ACM\u00a024(4), 664\u2013675 (1977)","journal-title":"Journal of ACM"},{"issue":"5","key":"27_CR9","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"},{"key":"27_CR10","doi-asserted-by":"crossref","unstructured":"Iliopoulos, C.S., Rahman, M.S.: Algorithms for computing variants of the longest common subsequence problem. Theoretical Computer Science (to appear)","DOI":"10.1016\/j.tcs.2008.01.009"},{"issue":"5","key":"27_CR11","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":"27_CR12","first-page":"8","volume":"1","author":"V.I. Levenshtein","year":"1965","unstructured":"Levenshtein, V.I.: Binary codes capable of correcting deletions, insertions, and reversals. Problems in Information Transmission\u00a01, 8\u201317 (1965)","journal-title":"Problems in Information Transmission"},{"issue":"2","key":"27_CR13","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1145\/322063.322075","volume":"25","author":"D. Maier","year":"1978","unstructured":"Maier, D.: The complexity of some problems on subsequences and supersequences. Journal of the ACM\u00a025(2), 322\u2013336 (1978)","journal-title":"Journal of the ACM"},{"issue":"1","key":"27_CR14","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/0022-0000(80)90002-1","volume":"20","author":"W.J. Masek","year":"1980","unstructured":"Masek, W.J., Paterson, M.: A faster algorithm computing string edit distances. J. Comput. Syst. Sci.\u00a020(1), 18\u201331 (1980)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"27_CR15","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/BF01840446","volume":"1","author":"E.W. Myers","year":"1986","unstructured":"Myers, E.W.: An O(ND) difference algorithm and its variations. Algorithmica\u00a01(2), 251\u2013266 (1986)","journal-title":"Algorithmica"},{"key":"27_CR16","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1016\/j.jalgor.2004.07.008","volume":"56","author":"V. Mkinen","year":"2005","unstructured":"Mkinen, V., Navarro, G., Ukkonen, E.: Transposition invariant string matching. Journal of Algorithms\u00a056, 124\u2013153 (2005)","journal-title":"Journal of Algorithms"},{"key":"27_CR17","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/BF00264437","volume":"18","author":"N. Nakatsu","year":"1982","unstructured":"Nakatsu, N., Kambayashi, Y., Yajima, S.: A longest common subsequence algorithm suitable for similar text strings. Acta Inf.\u00a018, 171\u2013179 (1982)","journal-title":"Acta Inf."},{"key":"27_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/11940128_41","volume-title":"Algorithms and Computation","author":"M.S. Rahman","year":"2006","unstructured":"Rahman, M.S., Iliopoulos, C.S.: Algorithms for computing variants of the longest common subsequence problem. In: Asano, T. (ed.) ISAAC 2006. LNCS, vol.\u00a04288, pp. 399\u2013408. Springer, Heidelberg (2006)"},{"issue":"1","key":"27_CR19","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. Journal of ACM\u00a021(1), 168\u2013173 (1974)","journal-title":"Journal of ACM"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73437-6_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:12:09Z","timestamp":1619503929000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73437-6_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540734369","9783540734376"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73437-6_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}