{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:15:50Z","timestamp":1753884950834,"version":"3.41.2"},"reference-count":4,"publisher":"World Scientific Pub Co Pte Ltd","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2023,5]]},"abstract":"<jats:p> We present an efficient algorithm for finding the longest common subsequence of two sequences in cases where the starting points of the sequences are not known. In addition, we differentiate between cases when there can or cannot be assumptions regarding the clustering of the subsequences. <\/jats:p>","DOI":"10.1142\/s1793830922501038","type":"journal-article","created":{"date-parts":[[2022,4,28]],"date-time":"2022-04-28T09:43:54Z","timestamp":1651139034000},"source":"Crossref","is-referenced-by-count":0,"title":["Cyclic longest common subsequence"],"prefix":"10.1142","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3594-3116","authenticated-orcid":false,"given":"Aaron E.","family":"Naiman","sequence":"first","affiliation":[{"name":"Department of Applied Mathematics, Jerusalem College of Technology-Machon Lev, Jerusalem, Israel"}]},{"given":"Eliav","family":"Farber","sequence":"additional","affiliation":[{"name":"Department of Applied Mathematics, Jerusalem College of Technology-Machon Lev, Jerusalem, Israel"}]},{"given":"Yossi","family":"Stein","sequence":"additional","affiliation":[{"name":"Department of Applied Mathematics, Jerusalem College of Technology-Machon Lev, Jerusalem, Israel"}]}],"member":"219","published-online":{"date-parts":[[2022,6,4]]},"reference":[{"volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","year":"1979","author":"Garey M. R.","key":"S1793830922501038BIB001"},{"key":"S1793830922501038BIB002","doi-asserted-by":"crossref","first-page":"243","DOI":"10.31449\/inf.v43i2.1823","volume":"43","author":"Naiman A. E.","year":"2019","journal-title":"Informatica"},{"key":"S1793830922501038BIB004","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.tcs.2006.10.002","volume":"370","author":"Nicolas F.","year":"2007","journal-title":"Theoret. Comput. Sci."},{"key":"S1793830922501038BIB005","first-page":"413","volume-title":"Proc. 13th Int. Conf. Pattern Recognition","volume":"2","author":"Oncina J.","year":"1996"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830922501038","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,30]],"date-time":"2023-04-30T10:35:50Z","timestamp":1682850950000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S1793830922501038"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,4]]},"references-count":4,"journal-issue":{"issue":"04","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["10.1142\/S1793830922501038"],"URL":"https:\/\/doi.org\/10.1142\/s1793830922501038","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2022,6,4]]},"article-number":"2250103"}}