{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:24:53Z","timestamp":1750307093493,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,6,27]],"date-time":"2012-06-27T00:00:00Z","timestamp":1340755200000},"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":[[2012,6,27]]},"DOI":"10.1145\/2347583.2347591","type":"proceedings-article","created":{"date-parts":[[2012,8,14]],"date-time":"2012-08-14T12:18:56Z","timestamp":1344946736000},"page":"61-66","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Quick-MLCS"],"prefix":"10.1145","author":[{"given":"Majid","family":"Sazvar","sequence":"first","affiliation":[{"name":"Ferdowsi University of Mashhad, Mashhad, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mahmoud","family":"Naghibzadeh","sequence":"additional","affiliation":[{"name":"Ferdowsi University of Mashhad, Mashhad, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nayyereh","family":"Saadati","sequence":"additional","affiliation":[{"name":"Mashhad University of Medical Sciences, Mashhad, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,6,27]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Aho A. Hopcroft J. Ullman J. 1983. Data structures and algorithms. Addison-Wesley.   Aho A. Hopcroft J. Ullman J. 1983. Data structures and algorithms. Addison-Wesley."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(92)90132-Y"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1093\/protein\/7.2.195"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/829519.830817"},{"key":"e_1_3_2_1_5_1","first-page":"26","article-title":"Genome-Scale Evolution: Reconstructing Gene Orders in the Ancestral Species","volume":"12","author":"Bourque G.","year":"2002","journal-title":"Genome Research"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-7-S4-S4"},{"key":"e_1_3_2_1_7_1","first-page":"463","article-title":"A Fast Algorithm for Computing Longest Common Subsequences of Small Alphabet Size","volume":"13","author":"Chin F. Y.","year":"1990","journal-title":"J. Information Processing"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1038\/scientificamerican0769-86"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1080\/10556789808805713"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/322033.322044"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01934514"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/359581.359603"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2008.79"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/322063.322075"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(80)90002-1"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1089\/106652799318373"},{"key":"e_1_3_2_1_19_1","unstructured":"Sankoff D. Kruskal J. B. 1983. Time warps string edits and macromolecules: the theory and practice of sequence comparison. Addison-Wesley.  Sankoff D. Kruskal J. B. 1983. Time warps string edits and macromolecules: the theory and practice of sequence comparison. Addison-Wesley."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.69.1.4"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-2836(81)90087-5"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.123"}],"event":{"name":"C3S2E '12: Fifth International C* Conference on Computer Science & Software Engineering","sponsor":["University of Limerick University of Limerick","BytePress","Concordia University Concordia University"],"location":"Montreal Quebec Canada","acronym":"C3S2E '12"},"container-title":["Proceedings of the Fifth International C* Conference on Computer Science and Software Engineering"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2347583.2347591","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2347583.2347591","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:34:37Z","timestamp":1750239277000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2347583.2347591"}},"subtitle":["a new algorithm for the multiple longest common subsequence problem"],"short-title":[],"issued":{"date-parts":[[2012,6,27]]},"references-count":20,"alternative-id":["10.1145\/2347583.2347591","10.1145\/2347583"],"URL":"https:\/\/doi.org\/10.1145\/2347583.2347591","relation":{},"subject":[],"published":{"date-parts":[[2012,6,27]]},"assertion":[{"value":"2012-06-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}