{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:18:48Z","timestamp":1725567528304},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642163203"},{"type":"electronic","value":"9783642163210"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16321-0_25","type":"book-chapter","created":{"date-parts":[[2010,10,5]],"date-time":"2010-10-05T14:51:32Z","timestamp":1286290292000},"page":"243-249","source":"Crossref","is-referenced-by-count":4,"title":["Finite Automata Based Algorithms for the Generalized Constrained Longest Common Subsequence Problems"],"prefix":"10.1007","author":[{"given":"Effat","family":"Farhana","sequence":"first","affiliation":[]},{"given":"Jannatul","family":"Ferdous","sequence":"additional","affiliation":[]},{"given":"Tanaeem","family":"Moosa","sequence":"additional","affiliation":[]},{"given":"M. Sohel","family":"Rahman","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"25_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":"Baeza-Yates, R.A.: Searching subsequences. Theoritical Computer Science\u00a078, 363\u2013376 (1991)","journal-title":"Theoritical Computer Science"},{"key":"25_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/321958.321970","volume":"23","author":"A.V. Aho","year":"1976","unstructured":"Aho, A.V., Hirchberg, D., Ullman, J.D.: Bounds on the complexity of longest common subsequence problem. Journal of the ACM\u00a023, 1\u201312 (1976)","journal-title":"Journal of the ACM"},{"key":"25_CR3","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/BF01840365","volume":"2","author":"A. Apostolico","year":"1987","unstructured":"Apostolico, A., Guerral, C.: The longest common subsequence problem revisited. Algorithmica\u00a02, 315\u2013336 (1987)","journal-title":"Algorithmica"},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"Arslan, A.N., E\u011fecio\u011flu, \u00d6: Algorithms for the constrained longest common subsequence problems. International Journal of Foundations Computer Science\u00a016(6), 1099\u20131109 (2005)","DOI":"10.1142\/S0129054105003674"},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"Bergroth, L., Hakonen, H., Raita, T.: A survey of longest common subsequence algorithms. In: String Processing and Information Retrieval (SPIRE), pp. 39\u201348 (2000)","DOI":"10.1109\/SPIRE.2000.878178"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"Chen, Y.-C., Chao, K.-M.: On the generaized constrained longest common subsequence problem. Journal of Combinatorial Optimization (2009)","DOI":"10.1007\/s10878-009-9262-5"},{"key":"25_CR7","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT press, McGraw-Hill, New York (2001)","edition":"2"},{"key":"25_CR8","first-page":"175","volume":"90","author":"A.D. Santis","year":"2003","unstructured":"Santis, A.D., Chin, F.Y.L., Ferrara, A.L.: A simple algorithm for the constrained longest common sequence problem. Information Processing Letters\u00a090, 175\u2013179 (2003)","journal-title":"Information Processing Letters"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"Gotthilf, Z., Hermelin, D., Landau, G.M., Lewinstein, M.: Restricted lcs. In: Accepted in String Processing and Information Retrieval, SPIRE (2010)","DOI":"10.1007\/978-3-642-16321-0_26"},{"key":"25_CR10","volume-title":"Introduction to Automata Theory,Languages, and Computation","author":"J.E. Hopcroft","year":"2001","unstructured":"Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory,Languages, and Computation, 2nd edn. Pearson Education, London (2001)","edition":"2"},{"key":"25_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/978-3-540-76336-9_30","volume-title":"Implementation and Application of Automata","author":"C.S. Iliopoulos","year":"2007","unstructured":"Iliopoulos, C.S., Rahman, M.S., Vor\u00e1\u010dek, M., Vagner, L.: Computing constrained longest common subsequence for degenerate strings using finite automata. In: Holub, J., \u017d\u010f\u00e1rek, J. (eds.) CIAA 2007. LNCS, vol.\u00a04783, pp. 309\u2013311. Springer, Heidelberg (2007)"},{"key":"25_CR12","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.ipl.2007.09.008","volume":"106","author":"C.S. Iliopoulos","year":"2008","unstructured":"Iliopoulos, C.S., Rahman, M.S.: New efficient algorithms for the lcs and constrained lcs problem. Information Processing Letters\u00a0106, 13\u201318 (2008)","journal-title":"Information Processing Letters"},{"key":"25_CR13","volume-title":"Elements of the Theory of Computation","author":"H.R. Lewis","year":"1998","unstructured":"Lewis, H.R., Papadimitriou, C.H.: Elements of the Theory of Computation, 2nd edn. Prentice-Hall, Englewood Cliffs (1998)","edition":"2"},{"issue":"1","key":"25_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. Journal of Computer and System Sciences\u00a020(1), 18\u201331 (1980)","journal-title":"Journal of Computer and System Sciences"},{"issue":"4","key":"25_CR15","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/j.ipl.2003.07.001","volume":"88","author":"Y.-T. Tsai","year":"2003","unstructured":"Tsai, Y.-T.: The constrained longest common subsequence problem. Information Processing Letters\u00a088(4), 173\u2013176 (2003)","journal-title":"Information Processing Letters"},{"issue":"1","key":"25_CR16","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 the ACM\u00a021(1), 168\u2013173 (1974)","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16321-0_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,5]],"date-time":"2019-06-05T07:13:22Z","timestamp":1559718802000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16321-0_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642163203","9783642163210"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16321-0_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}