{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:22:08Z","timestamp":1759335728554},"reference-count":3,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2008,2]]},"abstract":"<jats:p> An asymptotic lower bound for the maxrun function \u03c1(n) = max {number of runs in string x | all strings x of length n} is presented. More precisely, it is shown that for any \u03b5 &gt; 0, (\u03b1\u2212\u03b5)n is an asymptotic lower bound, where [Formula: see text]. A recent construction of an increasing sequence of binary strings \u201crich in runs\u201d is modified and extended to prove the result. <\/jats:p>","DOI":"10.1142\/s0129054108005620","type":"journal-article","created":{"date-parts":[[2008,2,20]],"date-time":"2008-02-20T04:46:31Z","timestamp":1203482791000},"page":"195-203","source":"Crossref","is-referenced-by-count":17,"title":["AN ASYMPTOTIC LOWER BOUND FOR THE MAXIMAL NUMBER OF RUNS IN A STRING"],"prefix":"10.1142","volume":"19","author":[{"given":"FRANTISEK","family":"FRANEK","sequence":"first","affiliation":[{"name":"Department of Computing and Software, McMaster University, Hamilton, Ontario L8S 4K1, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"QIAN","family":"YANG","sequence":"additional","affiliation":[{"name":"Department of Computing and Software, McMaster University, Hamilton, Ontario L8S 4K1, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(89)90051-6"},{"key":"rf2","first-page":"297","volume":"12","author":"Crochemore M.","journal-title":"Inform. Process. Lett."},{"key":"rf3","first-page":"159","volume":"1","author":"Kolpakov R.","journal-title":"J. Discrete Algorithms"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054108005620","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T11:29:30Z","timestamp":1565177370000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054108005620"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,2]]},"references-count":3,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2008,2]]}},"alternative-id":["10.1142\/S0129054108005620"],"URL":"https:\/\/doi.org\/10.1142\/s0129054108005620","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,2]]}}}