{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T06:48:57Z","timestamp":1778827737640,"version":"3.51.4"},"reference-count":25,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2002,11,1]],"date-time":"2002-11-01T00:00:00Z","timestamp":1036108800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3911,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[2002,11]]},"DOI":"10.1016\/s0022-0000(02)00004-1","type":"journal-article","created":{"date-parts":[[2003,1,21]],"date-time":"2003-01-21T13:45:29Z","timestamp":1043156729000},"page":"465-480","source":"Crossref","is-referenced-by-count":36,"title":["The longest common subsequence problem for sequences with nested arc annotations"],"prefix":"10.1016","volume":"65","author":[{"given":"Guohui","family":"Lin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhi-Zhong","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tao","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianjun","family":"Wen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(02)00004-1_BIB1","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1007\/BF01934985","article-title":"Efficient algorithms for combinatorial problems on graphs with bounded decomposability","volume":"25","author":"Arnborg","year":"1985","journal-title":"BIT"},{"key":"10.1016\/S0022-0000(02)00004-1_BIB2","doi-asserted-by":"crossref","unstructured":"V. Bafna, S. Muthukrishnan, R. Ravi, Computing similarity between RNA strings, in: Proceedings of the 6th Annual Symposium on Combinatorial Pattern Matching (CPM\u201995), Helsinki, Finland, Lecture Note in Computer Science, Vol. 937, 1995, pp. 1\u201316.","DOI":"10.1007\/3-540-60044-2_30"},{"key":"10.1016\/S0022-0000(02)00004-1_BIB3","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1145\/174644.174650","article-title":"Approximation algorithms for NP-complete problems on planar graphs","volume":"41","author":"Baker","year":"1994","journal-title":"J. ACM"},{"key":"10.1016\/S0022-0000(02)00004-1_BIB4","unstructured":"T.C. Biedl, P. Bose, E.D. Demaine, A. Lubiw, Efficient algorithms for Peterson's matching theorem, in: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u201999), Baltimore, MD, 1999, pp. 130\u2013139."},{"key":"10.1016\/S0022-0000(02)00004-1_BIB5","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1007\/PL00009182","article-title":"On triangulating planar graphs under the four-connectivity constraint","volume":"19","author":"Biedl","year":"1997","journal-title":"Algorithmica"},{"key":"10.1016\/S0022-0000(02)00004-1_BIB6","unstructured":"T.C. Biedl, G.-H. Lin, Planar cubic graphs are subhamiltonian, Manuscript, Department of Computer Science, University of Waterloo, March 2000."},{"key":"10.1016\/S0022-0000(02)00004-1_BIB7","unstructured":"H.L. Bodlaender, Planar graphs with bounded treewidth, Technical Report RUU-CS-88-14, Department of Computer Science, Utrecht University, The Netherlands, March 1988."},{"key":"10.1016\/S0022-0000(02)00004-1_BIB8","doi-asserted-by":"crossref","first-page":"1305","DOI":"10.1137\/S0097539793251219","article-title":"A linear time algorithm for finding tree-decompositions of small treewidth","volume":"25","author":"Bodlaender","year":"1996","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0022-0000(02)00004-1_BIB9","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1006\/jagm.1997.0894","article-title":"Efficient approximation schemes for maximization problems on K3,3-free or K5-free graphs","volume":"26","author":"Chen","year":"1998","journal-title":"J. Algorithms"},{"key":"10.1016\/S0022-0000(02)00004-1_BIB10","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1137\/0608002","article-title":"Embedding graphs in books","volume":"8","author":"Chung","year":"1987","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/S0022-0000(02)00004-1_BIB11","first-page":"389","article-title":"RNAling program","volume":"10","author":"Corpet","year":"1994","journal-title":"Comput. Appl. Bio-sci."},{"key":"10.1016\/S0022-0000(02)00004-1_BIB12","unstructured":"P.A. Evans, Algorithms and complexity for annotated sequence analysis, Ph.D. Thesis, University of Victoria, 1999."},{"key":"10.1016\/S0022-0000(02)00004-1_BIB13","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1137\/0601025","article-title":"The complexity of coloring circular arcs and chords","volume":"1","author":"Garey","year":"1980","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/S0022-0000(02)00004-1_BIB14","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","article-title":"Some simplified NP-complete graph problems","volume":"1","author":"Garey","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0022-0000(02)00004-1_BIB15","doi-asserted-by":"crossref","unstructured":"D. Goldman, S. Istrail, C.H. Papadimitriou, Algorithmic aspects of protein structure similarity, in: IEEE Proceedings of the 40th Annual Conference of Foundations of Computer Science (FOCS\u201999), 1999, pp. 512\u2013521.","DOI":"10.1109\/SFFCS.1999.814624"},{"key":"10.1016\/S0022-0000(02)00004-1_BIB16","series-title":"Algorithms on Strings, Trees, and Sequences","author":"Gusfield","year":"1997"},{"key":"10.1016\/S0022-0000(02)00004-1_BIB17","unstructured":"D.S. Hirschberg, The longest common subsequence problem, Ph.D. Thesis, Princeton University, 1975."},{"key":"10.1016\/S0022-0000(02)00004-1_BIB18","doi-asserted-by":"crossref","unstructured":"T. Jiang, G.-H. Lin, B. Ma, K. Zhang, The longest common subsequence problem for arc-annotated sequences, in: Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching (CPM 2000), Lecture Note in Computer Science, Vol. 1848, 2000, pp. 154\u2013165. Full paper accepted by Journal of Discrete Algorithms.","DOI":"10.1007\/3-540-45123-4_15"},{"key":"10.1016\/S0022-0000(02)00004-1_BIB19","doi-asserted-by":"crossref","unstructured":"H. Lenhof, K. Reinert, M. Vingron, A polyhedral approach to RNA sequence structure alignment, in: Proceedings of the Second Annual International Conference on Computational Molecular Biology (RECOMB\u201998), New York, NY, 1998, pp. 153\u2013159.","DOI":"10.1145\/279069.279109"},{"key":"10.1016\/S0022-0000(02)00004-1_BIB20","doi-asserted-by":"crossref","unstructured":"M. Li, B. Ma, L. Wang, Near optimal multiple sequence alignment within a band in polynomial time, in: ACM Proceedings of the 32nd Annual Symposium on Theory of Computing (STOC\u201900), Portland, OR, 2000, pp. 425\u2013434.","DOI":"10.1145\/335305.335354"},{"key":"10.1016\/S0022-0000(02)00004-1_BIB21","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF02392606","article-title":"Die theorie der regul\u00e4ren graphs (the theory of regular graphs)","volume":"15","author":"Peterson","year":"1891","journal-title":"Acta Math."},{"key":"10.1016\/S0022-0000(02)00004-1_BIB22","doi-asserted-by":"crossref","first-page":"810","DOI":"10.1137\/0145048","article-title":"Simultaneous solution of the RNA folding, alignment, and protosequence problems","volume":"45","author":"Sankoff","year":"1985","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/S0022-0000(02)00004-1_BIB23","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1145\/321796.321811","article-title":"The string-to-string correction problem","volume":"21","author":"Wagner","year":"1974","journal-title":"J. ACM"},{"key":"10.1016\/S0022-0000(02)00004-1_BIB24","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/0022-0000(89)90032-9","article-title":"Embedding planar graphs in four pages","volume":"38","author":"Yannakakis","year":"1989","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0022-0000(02)00004-1_BIB25","doi-asserted-by":"crossref","unstructured":"K. Zhang, L. Wang, B. Ma, Computing similarity between RNA structures, in: Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching (CPM\u201999), Warwick, UK, Lecture Note in Computer Science, Vol. 1645, 1999, pp. 281\u2013293.","DOI":"10.1007\/3-540-48452-3_21"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000002000041?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000002000041?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,12]],"date-time":"2020-03-12T02:04:38Z","timestamp":1583978678000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000002000041"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,11]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2002,11]]}},"alternative-id":["S0022000002000041"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(02)00004-1","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[2002,11]]}}}