{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T21:48:44Z","timestamp":1768772924565,"version":"3.49.0"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2006,12,9]],"date-time":"2006-12-09T00:00:00Z","timestamp":1165622400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2007,2,14]]},"DOI":"10.1007\/s10878-006-9030-8","type":"journal-article","created":{"date-parts":[[2006,12,8]],"date-time":"2006-12-08T17:29:25Z","timestamp":1165598965000},"page":"263-275","source":"Crossref","is-referenced-by-count":13,"title":["Improved algorithms for largest cardinality 2-interval pattern problem"],"prefix":"10.1007","volume":"13","author":[{"given":"Erdong","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Linji","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hao","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,12,9]]},"reference":[{"key":"9030_CR1","doi-asserted-by":"crossref","unstructured":"Alber J, Gramm J, Guo J, Niedermeier R (2004) Computing the similarity of two sequences with nested arc annotations. Theor Comput Sci 312(2\u20133):337\u2013358","DOI":"10.1016\/j.tcs.2003.10.026"},{"key":"9030_CR2","unstructured":"Bar-Yehuda R, Halld\u00f3rsson MM, Naor J, Shachnai H, Shapira I (2002) Scheduling split intervals. In: Proceedings of the 13th annual ACM-SIAM symposium on discrete algorithms, pp 732\u2013741"},{"key":"9030_CR3","doi-asserted-by":"crossref","unstructured":"Blin G, Fertin G, Vialette S (2004) New results for the 2-interval pattern problem. In: Combinatorial pattern matching, 15th annual symposium, CPM 2004, proceedings, Springer, pp 311\u2013322. ISBN 3-540-22341-X","DOI":"10.1007\/978-3-540-27801-6_23"},{"key":"9030_CR4","doi-asserted-by":"crossref","unstructured":"Crochemore M, Hermelin D, Landau GM, Vialette S (2005) Approximating the 2-interval pattern problem. In: ESA, pp 426\u2013437","DOI":"10.1007\/11561071_39"},{"key":"9030_CR5","doi-asserted-by":"crossref","unstructured":"Evans PA (1999) Finding common subsequences with arcs and pseudoknots. In: Crochemore M, Paterson M (eds) Combinatorial pattern matching, 10th annual symposium, CPM 99, proceedings, Springer, pp 270\u2013280. ISBN 3-540-66278-2","DOI":"10.1007\/3-540-48452-3_20"},{"issue":"1","key":"9030_CR6","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/S0166-218X(96)00013-3","volume":"74","author":"S Felsner","year":"1997","unstructured":"Felsner S, M\u00fcller R, Wernisch L (1997) Trapezoid graphs and generalizations, geometry and algorithms. Discr Appl Math 74(1):13\u201332","journal-title":"Discr Appl Math"},{"key":"9030_CR7","doi-asserted-by":"crossref","unstructured":"Golumbic M (1980) Algorithmic graph theory and perfect graphs. Academic Press, New York, NY","DOI":"10.1016\/B978-0-12-289260-8.50010-8"},{"key":"9030_CR8","doi-asserted-by":"crossref","unstructured":"Gramm J (2004) A polynomial-time algorithm for the matching of crossing contact-map patterns. In: Algorithms in bioinformatics, 4th international workshop, WABI 2004, proceedings, Springer, pp 38\u201349. ISBN 3-540-23018-1","DOI":"10.1007\/978-3-540-30219-3_4"},{"key":"9030_CR9","doi-asserted-by":"crossref","unstructured":"Hopcroft JE, Karp RM (1973) An \u00fan 5\/2\u00fa algorithm for maximum matchings in bipartite graphs. SIAM J Comput (4)","DOI":"10.1137\/0202019"},{"issue":"2","key":"9030_CR10","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/S1570-8667(03)00080-7","volume":"2","author":"T Jiang","year":"2004","unstructured":"Jiang T, Lin G, Ma B, Zhang K (2004) The longest common subsequence problem for arc-annotated sequences. J. Discr Algor 2(2):257\u2013270","journal-title":"J. Discr Algor"},{"key":"9030_CR11","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1002\/net.3230200203","volume":"20","author":"S Masuda","year":"1990","unstructured":"Masuda S, Nakajima K, Kashiwabara T, Fujisawa T (1990) Efficient algorithms for finding maximum cliques of an overlap graph. Networks 20:157\u2013171","journal-title":"Networks"},{"key":"9030_CR12","unstructured":"Micali S, Vazirani V (1980) An \u00faO( $$|{{\\sqrt{V}||}}E|$$ )\u00fa algorithm for finding maximum matching in general graphs. In: Proceedings of the 21st annual symposium on foundation of computer science, IEEE, pp 17\u201327"},{"key":"9030_CR13","doi-asserted-by":"crossref","unstructured":"Valiente G (2003) A new simple algorithm for the maximum-weight independent set problem on circle graphs. In: Algorithms and computation, 14th international symposium, ISAAC 2003, proceedings, Springer, pp 129\u2013137. ISBN 3-540-20695-7","DOI":"10.1007\/978-3-540-24587-2_15"},{"key":"9030_CR14","doi-asserted-by":"crossref","unstructured":"Vialette S (2004) On the computational complexity of 2-interval pattern matching problems. Theor Comput Sci 312(2\u20133):223\u2013249","DOI":"10.1016\/j.tcs.2003.08.010"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-006-9030-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-006-9030-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-006-9030-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:18:10Z","timestamp":1559276290000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-006-9030-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,12,9]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2007,2,14]]}},"alternative-id":["9030"],"URL":"https:\/\/doi.org\/10.1007\/s10878-006-9030-8","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,12,9]]}}}