{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T21:25:48Z","timestamp":1776288348351,"version":"3.50.1"},"reference-count":42,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities, Sun Yat-sen University","doi-asserted-by":"publisher","award":["19LGPY292"],"award-info":[{"award-number":["19LGPY292"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62002394"],"award-info":[{"award-number":["62002394"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/access.2021.3105607","type":"journal-article","created":{"date-parts":[[2021,8,16]],"date-time":"2021-08-16T20:21:44Z","timestamp":1629145304000},"page":"114965-114976","source":"Crossref","is-referenced-by-count":3,"title":["Fast Algorithms for Computing the Statistics of Pattern Matching"],"prefix":"10.1109","volume":"9","author":[{"given":"Danna","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Kai","family":"Jin","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","year":"2016","journal-title":"Penney’s Game"},{"key":"ref38","author":"grinstead","year":"2003","journal-title":"Introduction to Probability"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(96)00022-1"},{"key":"ref32","first-page":"1","article-title":"Computing the pattern waiting time: A revisit of the intuitive approach","volume":"64","author":"jin","year":"2016","journal-title":"Proc ISAAC"},{"key":"ref31","author":"cormen","year":"2009","journal-title":"Introduction to Algorithms"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1137\/0206024"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/828.1884"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009244"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1017\/S0021900200001042"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1137\/1135015"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(00)00195-5"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1038\/scientificamerican0574-120"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1126\/science.1621093"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s00285-007-0109-3"},{"key":"ref13","first-page":"36","article-title":"Multithreaded kmp: A proposed dna sequencing algorithm","volume":"3","author":"borah","year":"2015","journal-title":"International Journal of Engineering Science & Advanced Technology"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/AQTR.2006.254657"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2969038"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(81)90005-4"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.2307\/3213763"},{"key":"ref18","volume":"1","author":"feller","year":"1968","journal-title":"An Introduction to Probability Theory and Its Applications"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176994578"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1142\/4669"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107341005"},{"key":"ref27","author":"balakrishnan","year":"2002","journal-title":"Runs and Scans With Applications"},{"key":"ref3","author":"graham","year":"1994","journal-title":"Concrete Mathematics A Foundation for Computer Science"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/BF01354876"},{"key":"ref29","author":"iosifescu","year":"2014","journal-title":"Finite Markov Processes and Their Applications"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2914071"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1089\/10665270050081360"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TR.1986.4335561"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/1111022"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/BF02459461"},{"key":"ref1","first-page":"241","article-title":"Problem 95: Penney-ante","volume":"2","author":"penney","year":"1969","journal-title":"J Recreational Math"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/0304-4149(81)90025-9"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.2006.11920287"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/BF02506876"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-34770-3_15"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1239\/jap\/1395771430"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548300000365"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.spl.2008.03.023"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1994.10476841"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1239\/jap\/1019737988"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9312710\/09514871.pdf?arnumber=9514871","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,17]],"date-time":"2021-12-17T19:57:32Z","timestamp":1639771052000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9514871\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":42,"URL":"https:\/\/doi.org\/10.1109\/access.2021.3105607","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]}}}