{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,10]],"date-time":"2025-05-10T15:44:46Z","timestamp":1746891886162},"reference-count":15,"publisher":"World Scientific Pub Co Pte Lt","issue":"08","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2013,12]]},"abstract":"<jats:p>It is often a necessity to compare some sequences to find out how similar they are. There are many similarity measures that can be used, e.g., longest common subsequence, edit distance, sequence alignment. Recently a merged longest common subsequence (MergedLCS) problem was formulated with applications in bioinformatics. We propose the bit-parallel algorithms for the MergedLCS problem and evaluate them in practice showing that they are usually tens times faster than the already published methods.<\/jats:p>","DOI":"10.1142\/s0129054113500342","type":"journal-article","created":{"date-parts":[[2014,4,2]],"date-time":"2014-04-02T06:43:49Z","timestamp":1396421029000},"page":"1281-1298","source":"Crossref","is-referenced-by-count":5,"title":["BIT-PARALLEL ALGORITHMS FOR THE MERGED LONGEST COMMON SUBSEQUENCE PROBLEM"],"prefix":"10.1142","volume":"24","author":[{"given":"SEBASTIAN","family":"DEOROWICZ","sequence":"first","affiliation":[{"name":"Institute of Informatics, Silesian University of Technology, Akademicka 16, 44-100 Gliwice, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"AGNIESZKA","family":"DANEK","sequence":"additional","affiliation":[{"name":"Institute of Informatics, Silesian University of Technology, Akademicka 16, 44-100 Gliwice, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2014,4]]},"reference":[{"key":"p_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(86)90091-8"},{"key":"p_4","doi-asserted-by":"publisher","DOI":"10.1145\/135239.135243"},{"key":"p_5","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2004.02.008"},{"key":"p_6","first-page":"71","volume":"11","author":"Crawford T.","year":"1998","journal-title":"Computing in Musicology"},{"key":"p_7","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(01)00182-X"},{"key":"p_8","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2006.04.018"},{"issue":"2","key":"p_9","first-page":"91","volume":"19","author":"Deorowicz S.","year":"2007","journal-title":"Theoretical and Applied Informatics"},{"issue":"4","key":"p_10","doi-asserted-by":"crossref","first-page":"409","DOI":"10.3233\/FI-2010-256","volume":"99","author":"Deorowicz S.","year":"2010","journal-title":"Fundamenta Informaticae"},{"key":"p_11","first-page":"29","volume":"3","author":"D\u00f6m\u00f6lki B.","year":"1964","journal-title":"Computational Linguistics"},{"key":"p_14","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2007.08.028"},{"key":"p_15","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2006.11.006"},{"key":"p_17","doi-asserted-by":"publisher","DOI":"10.1038\/nature02424"},{"issue":"4","key":"p_20","first-page":"1935","volume":"6","author":"Peng Y.-H.","year":"2010","journal-title":"Information and Control"},{"key":"p_21","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2003.07.001"},{"key":"p_23","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2004.10.014"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054113500342","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,17]],"date-time":"2020-08-17T03:56:11Z","timestamp":1597636571000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054113500342"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12]]},"references-count":15,"journal-issue":{"issue":"08","published-online":{"date-parts":[[2014,4]]},"published-print":{"date-parts":[[2013,12]]}},"alternative-id":["10.1142\/S0129054113500342"],"URL":"https:\/\/doi.org\/10.1142\/s0129054113500342","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,12]]}}}