{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T11:09:17Z","timestamp":1693825757902},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,12,28]],"date-time":"2013-12-28T00:00:00Z","timestamp":1388188800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1007\/s00453-013-9859-z","type":"journal-article","created":{"date-parts":[[2013,12,27]],"date-time":"2013-12-27T15:04:13Z","timestamp":1388156653000},"page":"430-449","source":"Crossref","is-referenced-by-count":5,"title":["Resequencing a Set of Strings Based on a Target String"],"prefix":"10.1007","volume":"72","author":[{"given":"Chih-En","family":"Kuo","sequence":"first","affiliation":[]},{"given":"Yue-Li","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Jia-Jie","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Ming-Tat","family":"Ko","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,12,28]]},"reference":[{"issue":"1","key":"9859_CR1","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/BF01840359","volume":"2","author":"A. Aggarwal","year":"1987","unstructured":"Aggarwal, A., Klawe, M.M., Moran, S., Shor, P., Wilber, R.: Geometric applications of a matrix-searching algorithm. Algorithmica 2(1), 195\u2013208 (1987)","journal-title":"Algorithmica"},{"issue":"1","key":"9859_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/321921.321922","volume":"23","author":"A. Aho","year":"1976","unstructured":"Aho, A., Hirschberg, D., Ullman, J.: Bounds on the complexity of the longest common subsequence problem. J. ACM 23(1), 1\u201312 (1976)","journal-title":"J. ACM"},{"issue":"7","key":"9859_CR3","doi-asserted-by":"crossref","first-page":"1025","DOI":"10.1016\/j.dam.2007.05.056","volume":"156","author":"C.E.R. Alves","year":"2008","unstructured":"Alves, C.E.R., C\u00e1ceres, E.N., Song, S.W.: An all-substrings common subsequence algorithm. Discrete Appl. Math. 156(7), 1025\u20131035 (2008)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"9859_CR4","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1016\/j.tcs.2008.08.037","volume":"409","author":"A. Amir","year":"2008","unstructured":"Amir, A., Hartman, T., Kapah, O., Shalom, R., Tsur, D.: Generalized LCS. Theor. Comput. Sci. 409(3), 438\u2013449 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"9859_CR5","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1007\/978-3-642-10217-2_7","volume-title":"Proceedings of Combinatorial Algorithms: 20th International Workshop, IWOCA 2009","author":"A. Amir","year":"2009","unstructured":"Amir, A., Gothilf, T., Shalom, R.: Weighted LCS. In: Proceedings of Combinatorial Algorithms: 20th International Workshop, IWOCA 2009, pp. 36\u201347 (2009)"},{"key":"9859_CR6","first-page":"31","volume-title":"Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2006)","author":"W.W. Bein","year":"2006","unstructured":"Bein, W.W., Golin, M.J., Larmore, L.L., Zhang, Y.: The Knuth-Yao quadrangle-inequality speedup is a consequence of total-monotonicity. In: Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2006), pp. 31\u201340 (2006)"},{"key":"9859_CR7","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1109\/SPIRE.2000.878178","volume-title":"Proceedings of 7th Symposium on String Processing and Information Retrieval (SPIRE 2000)","author":"L. Bergroth","year":"2000","unstructured":"Bergroth, L., Hakonen, H., Raita, T.: A\u00a0survey of longest common subsequence algorithms. In: Proceedings of 7th Symposium on String Processing and Information Retrieval (SPIRE 2000), pp. 39\u201348 (2000)"},{"key":"9859_CR8","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1145\/321812.321815","volume":"21","author":"R.P. Brent","year":"1974","unstructured":"Brent, R.P.: The parallel evaluation of general arithmetic expressions. J. ACM 21, 201\u2013206 (1974)","journal-title":"J. ACM"},{"issue":"1","key":"9859_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2005.04.050","volume":"176","author":"R.E. Burkard","year":"2007","unstructured":"Burkard, R.E.: Monge properties, discrete convexity and applications. Eur. J. Oper. Res. 176(1), 1\u201314 (2007)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"9859_CR10","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0166-218X(95)00103-X","volume":"70","author":"R.E. Burkard","year":"1996","unstructured":"Burkard, R.E., Klinz, B., Rudolf, R.: Perspectives of Monge properties in optimization. Discrete Appl. Math. 70(2), 95\u2013161 (1996)","journal-title":"Discrete Appl. Math."},{"key":"9859_CR11","unstructured":"Chvatal, V., Klarner, D.A., Knuth, D.E.: Selected combinatorial research problem. Technical Report CS-TR-72-292, Stanford University (1972)"},{"key":"9859_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1007\/978-3-540-73420-8_15","volume-title":"Proc. 34th International Colloquium on Automata, Languages and Programming (ICALP)","author":"E.D. Demaine","year":"2007","unstructured":"Demaine, E.D., Mozes, S., Rossman, B., Weimann, O.: An optimal decomposition algorithm for tree edit distance. In: Proc. 34th International Colloquium on Automata, Languages and Programming (ICALP). Lecture Notes in Computer Science, vol. 4596, pp. 146\u2013157 (2007)"},{"key":"9859_CR13","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":"4","key":"9859_CR14","doi-asserted-by":"crossref","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. J. ACM 24(4), 664\u2013675 (1977)","journal-title":"J. ACM"},{"key":"9859_CR15","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/j.ipl.2006.11.006","volume":"102","author":"K.S. Huang","year":"2007","unstructured":"Huang, K.S., Yang, C.B., Tseng, K.T., Peng, Y.H., Ann, H.Y.: Dynamic programming algorithms for the mosaic longest common subsequence problem. Inf. Process. Lett. 102, 99\u2013103 (2007)","journal-title":"Inf. Process. Lett."},{"key":"9859_CR16","first-page":"560","volume-title":"The Art of Computer Programming","author":"D.E. Knuth","year":"1973","unstructured":"Knuth, D.E.: The Art of Computer Programming, pp. 560\u2013563. Addison-Wesley, Reading (1973)"},{"key":"9859_CR17","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1145\/267521.267546","volume-title":"RECOMB97: Proceedings of the First Annual International Conference on Computational Molecular Biology","author":"G.A. Komatsoulis","year":"1997","unstructured":"Komatsoulis, G.A., Waterman, M.S.: Chimeric alignment by dynamic programming: algorithm and biological uses. In: RECOMB97: Proceedings of the First Annual International Conference on Computational Molecular Biology, pp. 174\u2013180. ACM Press, New York (1997)"},{"issue":"6","key":"9859_CR18","doi-asserted-by":"crossref","first-page":"2338","DOI":"10.1128\/AEM.63.6.2338-2346.1997","volume":"63","author":"G.A. Komatsoulis","year":"1997","unstructured":"Komatsoulis, G.A., Waterman, M.S.: A\u00a0new computational method for detection of chimeric 16S rRNA artifacts generated by PCR amplification from mixed bacterial populations. Appl. Environ. Microbiol. 63(6), 2338\u20132346 (1997)","journal-title":"Appl. Environ. Microbiol."},{"issue":"2","key":"9859_CR19","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1006\/jagm.2001.1191","volume":"41","author":"G.M. Landau","year":"2001","unstructured":"Landau, G.M., Ziv-Ukelson, M.: On the common substring alignment problem. J. Algorithms 41(2), 338\u2013359 (2001)","journal-title":"J. Algorithms"},{"key":"9859_CR20","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/j.jco.2007.06.003","volume":"24","author":"J.J. Liu","year":"2008","unstructured":"Liu, J.J., Wang, Y.L., Lee, R.C.T.: Finding a longest common subsequence between a run-length-encoded string and an uncompressed string. J. Complex. 24, 173\u2013184 (2008)","journal-title":"J. Complex."},{"key":"9859_CR21","doi-asserted-by":"crossref","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.S.: A\u00a0faster algorithm computing string edit distances. J. Comput. Syst. Sci. 20, 18\u201331 (1980)","journal-title":"J. Comput. Syst. Sci."},{"key":"9859_CR22","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/S0065-2164(08)70055-8","volume":"30","author":"J. Modelevsky","year":"1984","unstructured":"Modelevsky, J.: Computer applications in applied genetic engineering. Adv. Appl. Microbiol. 30, 169\u2013195 (1984)","journal-title":"Adv. Appl. Microbiol."},{"issue":"1","key":"9859_CR23","doi-asserted-by":"crossref","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 21(1), 168\u2013173 (1974)","journal-title":"J. ACM"},{"issue":"6","key":"9859_CR24","doi-asserted-by":"crossref","first-page":"1245","DOI":"10.1137\/0218082","volume":"18","author":"K. Zhang","year":"1989","unstructured":"Zhang, K., Shasha, D.: Simple fast algorithms for the editing distance between trees and related problems. SIAM J. Comput. 18(6), 1245\u20131262 (1989)","journal-title":"SIAM J. Comput."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-013-9859-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-013-9859-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-013-9859-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,12]],"date-time":"2020-08-12T23:19:31Z","timestamp":1597274371000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-013-9859-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12,28]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,6]]}},"alternative-id":["9859"],"URL":"https:\/\/doi.org\/10.1007\/s00453-013-9859-z","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,12,28]]}}}