{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:32:17Z","timestamp":1750307537976,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":11,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,3,28]],"date-time":"2008-03-28T00:00:00Z","timestamp":1206662400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2008,3,28]]},"DOI":"10.1145\/1593105.1593164","type":"proceedings-article","created":{"date-parts":[[2009,8,11]],"date-time":"2009-08-11T13:29:27Z","timestamp":1249997367000},"page":"226-230","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["A space efficient algorithm for the constrained heaviest common subsequence problem"],"prefix":"10.1145","author":[{"given":"Rao","family":"Li","sequence":"first","affiliation":[{"name":"University of South Carolina Aiken, Aiken, SC"}]}],"member":"320","published-online":{"date-parts":[[2008,3,28]]},"reference":[{"volume-title":"G. Rozenberg and A. Salomaa (Eds.)","year":"1997","author":"Apostolico A.","key":"e_1_3_2_1_1_1"},{"volume-title":"CRC","year":"1998","author":"Apostolico A.","key":"e_1_3_2_1_2_1"},{"volume-title":"SPIRE, A Coruña","year":"2000","author":"Bergroth L.","key":"e_1_3_2_1_3_1"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2004.02.008"},{"volume-title":"MIT Press","year":"2001","author":"Cormen T.","key":"e_1_3_2_1_5_1"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/360825.360861"},{"volume-title":"Pattern Matching Algorithms","year":"1997","author":"Hirschberg D.","key":"e_1_3_2_1_7_1"},{"key":"e_1_3_2_1_8_1","unstructured":"R. Li A linear space algorithm for the heaviest common subsequence problem to appear.  R. Li A linear space algorithm for the heaviest common subsequence problem to appear."},{"key":"e_1_3_2_1_9_1","first-page":"123","volume":"174","author":"Li R.","year":"2005","journal-title":"Congressus Numerantium"},{"volume-title":"University of Bonn","year":"1994","author":"Rick C.","key":"e_1_3_2_1_10_1"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2003.07.001"}],"event":{"name":"ACM SE08: ACM Southeast Regional Conference","acronym":"ACM SE08","location":"Auburn Alabama"},"container-title":["Proceedings of the 46th Annual Southeast Regional Conference on XX"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1593105.1593164","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1593105.1593164","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:23:19Z","timestamp":1750249399000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1593105.1593164"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,3,28]]},"references-count":11,"alternative-id":["10.1145\/1593105.1593164","10.1145\/1593105"],"URL":"https:\/\/doi.org\/10.1145\/1593105.1593164","relation":{},"subject":[],"published":{"date-parts":[[2008,3,28]]},"assertion":[{"value":"2008-03-28","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}