{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T10:41:10Z","timestamp":1725878470412},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319520148"},{"type":"electronic","value":"9783319520155"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-52015-5_43","type":"book-chapter","created":{"date-parts":[[2017,1,11]],"date-time":"2017-01-11T22:51:57Z","timestamp":1484175117000},"page":"419-428","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Computation for the Longest Common Subsequence with Substring Inclusion and Subsequence Exclusion Constraints"],"prefix":"10.1007","author":[{"given":"Xiaodong","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daxin","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,1,13]]},"reference":[{"issue":"3","key":"43_CR1","doi-asserted-by":"crossref","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."},{"key":"43_CR2","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511546853","volume-title":"Algorithms on Strings","author":"M Crochemore","year":"2007","unstructured":"Crochemore, M., Hancart, C., Lecroq, T.: Algorithms on Strings. Cambridge University Press, Cambridge (2007)"},{"issue":"11","key":"43_CR3","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1016\/j.ipl.2012.02.007","volume":"112","author":"S Deorowicz","year":"2012","unstructured":"Deorowicz, S.: Quadratic-time algorithm for a string constrained LCS problem. Inform. Process. Lett. 112(11), 423\u2013426 (2012)","journal-title":"Inform. Process. Lett."},{"issue":"3","key":"43_CR4","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":"43_CR5","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). doi: 10.1007\/978-3-540-69068-9_24"},{"key":"43_CR6","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). doi: 10.1007\/978-3-642-16321-0_26"},{"key":"43_CR7","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology","author":"D Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, Cambridge (1997)"},{"issue":"1","key":"43_CR8","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1142\/S012905411000712X","volume":"21","author":"YH Peng","year":"2010","unstructured":"Peng, Y.H., Yang, C.B., Huang, K.S., Tseng, K.T.: An algorithm and applications to sequence alignment with weighted constraints. Int. J. Found. Comput. Sci. 21(1), 51\u201359 (2010)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"43_CR9","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1142\/S0219720003000095","volume":"1","author":"CY Tang","year":"2003","unstructured":"Tang, C.Y., Lu, C.L.: Constrained multiple sequence alignment tool development and its application to RNase family alignment. J. Bioinform. Comput. Biol. 1, 267\u2013287 (2003)","journal-title":"J. Bioinform. Comput. Biol."},{"key":"43_CR10","doi-asserted-by":"crossref","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. Complex. 29, 44\u201352 (2013)","journal-title":"J. Complex."}],"container-title":["Lecture Notes in Computer Science","Smart Computing and Communication"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-52015-5_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T04:01:53Z","timestamp":1498363313000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-52015-5_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319520148","9783319520155"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-52015-5_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}