{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T16:39:30Z","timestamp":1740155970604,"version":"3.37.3"},"reference-count":6,"publisher":"World Scientific Pub Co Pte Ltd","issue":"03","funder":[{"DOI":"10.13039\/501100003141","name":"Consejo Nacional de Ciencia y Tecnolog\u00eda","doi-asserted-by":"publisher","award":["238469"],"award-info":[{"award-number":["238469"]}],"id":[{"id":"10.13039\/501100003141","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2017,6]]},"abstract":"<jats:p> For [Formula: see text], define [Formula: see text] as the set of integers [Formula: see text]. Given an integer [Formula: see text] and a string [Formula: see text] of length [Formula: see text] over [Formula: see text], we count the number of times that each one of the [Formula: see text] distinct strings of length [Formula: see text] over [Formula: see text] occurs as a subsequence of [Formula: see text]. Our algorithm makes only one scan of [Formula: see text] and solves the problem in time complexity [Formula: see text] and space complexity [Formula: see text]. These are very close to best possible. <\/jats:p>","DOI":"10.1142\/s1793830917500422","type":"journal-article","created":{"date-parts":[[2017,5,29]],"date-time":"2017-05-29T05:22:02Z","timestamp":1496035322000},"page":"1750042","source":"Crossref","is-referenced-by-count":0,"title":["Near-optimal algorithm to count occurrences of subsequences of a given length"],"prefix":"10.1142","volume":"09","author":[{"given":"Jose","family":"Torres-Jimenez","sequence":"first","affiliation":[{"name":"CINVESTAV-Tamaulipas, Information Technology Laboratory, Km. 5.5 Carretera Cd. Victoria-Soto la Marina, 87130, Cd. Victoria Tamps., M\u00e9xico"}]},{"given":"Idelfonso","family":"Izquierdo-Marquez","sequence":"additional","affiliation":[{"name":"CINVESTAV-Tamaulipas, Information Technology Laboratory, Km. 5.5 Carretera Cd. Victoria-Soto la Marina, 87130, Cd. Victoria Tamps., M\u00e9xico"}]},{"given":"Daniel","family":"Ramirez-Acuna","sequence":"additional","affiliation":[{"name":"CINVESTAV-Tamaulipas, Information Technology Laboratory, Km. 5.5 Carretera Cd. Victoria-Soto la Marina, 87130, Cd. Victoria Tamps., M\u00e9xico"}]},{"given":"Rene","family":"Peralta","sequence":"additional","affiliation":[{"name":"National Institute of Standards and Technology, Gaithersburg, MD 20899-8910, USA"}]}],"member":"219","published-online":{"date-parts":[[2017,5,29]]},"reference":[{"key":"S1793830917500422BIB001","doi-asserted-by":"publisher","DOI":"10.1007\/11780441_30"},{"key":"S1793830917500422BIB002","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2010.04.003"},{"key":"S1793830917500422BIB003","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.08.035"},{"key":"S1793830917500422BIB004","doi-asserted-by":"publisher","DOI":"10.1007\/11780441_15"},{"key":"S1793830917500422BIB005","doi-asserted-by":"publisher","DOI":"10.1145\/321796.321811"},{"key":"S1793830917500422BIB006","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2004.10.014"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830917500422","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,25]],"date-time":"2019-09-25T02:08:08Z","timestamp":1569377288000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830917500422"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5,29]]},"references-count":6,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2017,2,24]]},"published-print":{"date-parts":[[2017,6]]}},"alternative-id":["10.1142\/S1793830917500422"],"URL":"https:\/\/doi.org\/10.1142\/s1793830917500422","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2017,5,29]]}}}