{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T23:25:06Z","timestamp":1725837906417},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319271392"},{"type":"electronic","value":"9783319271408"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-27140-8_11","type":"book-chapter","created":{"date-parts":[[2015,11,16]],"date-time":"2015-11-16T08:27:57Z","timestamp":1447662477000},"page":"151-160","source":"Crossref","is-referenced-by-count":0,"title":["An Efficient Algorithm for a Generalized LCS\u00a0Problem"],"prefix":"10.1007","author":[{"given":"Daxin","family":"Zhu","sequence":"first","affiliation":[]},{"given":"Yingjie","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Xiaodong","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,12,16]]},"reference":[{"issue":"6","key":"11_CR1","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1145\/360825.360855","volume":"18","author":"AV Aho","year":"1975","unstructured":"Aho, A.V., Corasick, M.J.: Efficient string matching: an aid to bibliographic search. Commun. ACM 18(6), 333\u2013340 (1975)","journal-title":"Commun. ACM"},{"issue":"3","key":"11_CR2","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/j.ic.2009.12.001","volume":"208","author":"HY Ann","year":"2010","unstructured":"Ann, H.Y., Yang, C.B., Peng, Y.H., Liaw, B.C.: Efficient algorithms for the block edit problems. Inf. Comput. 208(3), 221\u2013229 (2010)","journal-title":"Inf. Comput."},{"issue":"6","key":"11_CR3","doi-asserted-by":"publisher","first-page":"1099","DOI":"10.1142\/S0129054105003674","volume":"16","author":"AN Arslan","year":"2005","unstructured":"Arslan, A.N., Egecioglu, O.: Algorithms for the constrained longest common subsequence problems. Int. J. Found. Comput. Sci. 16(6), 1099\u20131109 (2005)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"3","key":"11_CR4","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/s10878-009-9262-5","volume":"21","author":"YC Chen","year":"2011","unstructured":"Chen, Y.C., Chao, K.M.: On the generalized constrained longest common subsequence problems. J. Comb. Optim. 21(3), 383\u2013392 (2011)","journal-title":"J. Comb. Optim."},{"issue":"4","key":"11_CR5","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/j.ipl.2004.02.008","volume":"90","author":"FYL Chin","year":"2004","unstructured":"Chin, F.Y.L., Santis, A.D., Ferrara, A.L., Ho, N.L., Kim, S.K.: A simple algorithm for the constrained sequence problems. Inform. Process. Lett. 90(4), 175\u2013179 (2004)","journal-title":"Inform. Process. Lett."},{"issue":"3","key":"11_CR6","first-page":"427","volume":"29","author":"S Deorowicz","year":"2010","unstructured":"Deorowicz, S., Obstoj, J.: Constrained longest common subsequence computing algorithms in practice. Comput. Inform. 29(3), 427\u2013445 (2010)","journal-title":"Comput. Inform."},{"key":"11_CR7","series-title":"lecture notes in computer science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/978-3-540-69068-9_24","volume-title":"Combinatorial Pattern Matching","author":"Z Gotthilf","year":"2008","unstructured":"Gotthilf, Z., Hermelin, D., Lewenstein, M.: Constrained LCS: hardness and approximation. In: Ferragina, P., Landau, G.M. (eds.) CPM 2008. LNCS, vol. 5029, pp. 255\u2013262. Springer, Heidelberg (2008)"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/978-3-642-16321-0_26","volume-title":"String Processing and Information Retrieval","author":"Z Gotthilf","year":"2010","unstructured":"Gotthilf, Z., Hermelin, D., Landau, G.M., Lewenstein, M.: Restricted LCS. In: Chavez, E., Lonardi, S. (eds.) SPIRE 2010. LNCS, vol. 6393, pp. 250\u2013257. Springer, Heidelberg (2010)"},{"issue":"4","key":"11_CR9","doi-asserted-by":"publisher","first-page":"664","DOI":"10.1145\/322033.322044","volume":"24","author":"DS Hirschberg","year":"1977","unstructured":"Hirschberg, D.S.: Algorithms for the longest common subsequence problem. J. ACM 24(4), 664\u2013675 (1977)","journal-title":"J. ACM"},{"issue":"2","key":"11_CR10","first-page":"355","volume":"45","author":"CS Iliopoulos","year":"2009","unstructured":"Iliopoulos, C.S., Rahman, M.S.: A new efficient algorithm for computing the longest common subsequence. Theor. Comput. Sci. 45(2), 355\u2013371 (2009)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"11_CR11","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/j.jda.2008.10.004","volume":"8","author":"CS Iliopoulos","year":"2010","unstructured":"Iliopoulos, C.S., Rahman, M.S., Vorcek, M., Vagner, L.: Finite automata based algorithms on subsequences and supersequences of degenerate strings. J. Discret. Algorithm. 8(2), 117\u2013130 (2010)","journal-title":"J. Discret. Algorithm."},{"key":"11_CR12","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. J. ACM 25, 322\u2013336 (1978)","journal-title":"J. ACM"},{"issue":"1","key":"11_CR13","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.cor.2007.07.006","volume":"36","author":"SJ Shyu","year":"2009","unstructured":"Shyu, S.J., Tsai, C.Y.: Finding the longest common subsequence for multiple biological sequences by ant colony optimization. Comput. Oper. Res. 36(1), 73\u201391 (2009)","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"11_CR14","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/j.ipl.2003.07.001","volume":"88","author":"YT Tsai","year":"2003","unstructured":"Tsai, Y.T.: The constrained longest common subsequence problem. Inform. Process. Lett. 88(4), 173\u2013176 (2003)","journal-title":"Inform. Process. Lett."},{"key":"11_CR15","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/j.jco.2012.08.002","volume":"29","author":"CT Tseng","year":"2013","unstructured":"Tseng, C.T., Yang, C.B., Ann, H.Y.: Efficient algorithms for the longest common subsequence problem with sequential substring constraints. J. Complexity 29, 44\u201352 (2013)","journal-title":"J. Complexity"},{"issue":"1","key":"11_CR16","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1145\/321796.321811","volume":"21","author":"R Wagner","year":"1974","unstructured":"Wagner, R., Fischer, M.: The string-to-string correction problem. J. ACM 21(1), 168\u2013173 (1974)","journal-title":"J. ACM"},{"issue":"1","key":"11_CR17","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1016\/j.ipl.2013.07.005","volume":"113","author":"L Wang","year":"2013","unstructured":"Wang, L., Wang, X., Wu, Y., Zhu, D.: A dynamic programming solution to a generalized LCS problem. Inform. Process. Lett. 113(1), 723\u2013728 (2013)","journal-title":"Inform. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-27140-8_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T11:12:26Z","timestamp":1559301146000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-27140-8_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319271392","9783319271408"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-27140-8_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}