{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T20:49:40Z","timestamp":1742935780183,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319948119"},{"type":"electronic","value":"9783319948126"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-94812-6_11","type":"book-chapter","created":{"date-parts":[[2018,6,28]],"date-time":"2018-06-28T22:12:26Z","timestamp":1530223946000},"page":"121-132","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Online Stochastic Pattern Matching"],"prefix":"10.1007","author":[{"given":"Marco","family":"Cognetta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yo-Sub","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,6,29]]},"reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1145\/360825.360855","volume":"18","author":"A Aho","year":"1975","unstructured":"Aho, A., Corasick, M.: Efficient string matching: an aid to bibliographic search. Commun. ACM 18, 333\u2013340 (1975)","journal-title":"Commun. ACM"},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1147\/rd.453.0449","volume":"45","author":"E Birney","year":"2001","unstructured":"Birney, E.: Hidden Markov models in biological sequence analysis. IBM J. Res. Dev. 45, 449\u2013454 (2001)","journal-title":"IBM J. Res. Dev."},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/s00224-003-1061-2","volume":"36","author":"VD Blondel","year":"2003","unstructured":"Blondel, V.D., Canterini, V.: Undecidable problems for probabilistic automata of fixed dimension. Theory Comput. Syst. 36, 231\u2013245 (2003)","journal-title":"Theory Comput. Syst."},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-540-45257-7_2","volume-title":"Grammatical Inference: Algorithms and Applications","author":"Francisco Casacuberta","year":"2000","unstructured":"Casacuberta, F., de la Higuera, C.: Computational complexity of problems on probabilistic grammars and transducers. In: Proceedings of the 5th International Colloquium on Grammatical Inference: Algorithms and Applications, pp. 15\u201324 (2000)"},{"key":"11_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-01492-5","volume-title":"Handbook of Weighted Automata","author":"M Droste","year":"2009","unstructured":"Droste, M., Kuich, W., Volger, H.: Handbook of Weighted Automata. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-01492-5"},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"1349","DOI":"10.1016\/j.patcog.2004.03.020","volume":"38","author":"P Dupont","year":"2005","unstructured":"Dupont, P., Denis, F., Esposito, Y.: Links between probabilistic automata and hidden Markov models: probability distributions, learning models and induction algorithms. Pattern Recogn. 38, 1349\u20131371 (2005)","journal-title":"Pattern Recogn."},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-3-540-45257-7_9","volume-title":"Grammatical Inference: Algorithms and Applications","author":"Ana L. N. Fred","year":"2000","unstructured":"Fred, A.L.N.: Computation of substring probabilities in stochastic grammars. In: Proceedings of the 5th International Colloquium on Grammatical Inference: Algorithms and Applications, pp. 103\u2013114 (2000)"},{"key":"11_CR8","unstructured":"Guttman, O.: Probabilistic automata and distributions over sequences. Ph.D. thesis, The Australian National University (2006)"},{"key":"11_CR9","unstructured":"de la Higuera, C., Oncina, J.: Computing the most probable string with a probabilistic finite state machine. In: Proceedings of the 11th International Conference on Finite State Methods and Natural Language Processing, pp. 1\u20138 (2013)"},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1093\/logcom\/exs049","volume":"24","author":"C de la Higuera","year":"2014","unstructured":"de la Higuera, C., Oncina, J.: The most probable string: an algorithmic study. J. Logic Comput. 24, 311\u2013330 (2014)","journal-title":"J. Logic Comput."},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"DE Knuth","year":"1977","unstructured":"Knuth, D.E., Morris Jr., J.H., Pratt, V.R.: Fast pattern matching in strings. SIAM J. Comput. 6, 323\u2013350 (1977)","journal-title":"SIAM J. Comput."},{"key":"11_CR12","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1006\/csla.2001.0184","volume":"16","author":"M Mohri","year":"2002","unstructured":"Mohri, M., Pereira, F., Riley, M.: Speech recognition with weighted finite-state transducers. Comput. Speech Lang. 16, 69\u201388 (2002)","journal-title":"Comput. Speech Lang."},{"key":"11_CR13","unstructured":"Nederhof, M., Satta, G.: Computation of infix probabilities for probabilistic context-free grammars. In: Proceedings of the 2011 Conference on Empirical Methods in Natural Language Processing, pp. 1213\u20131221 (2011)"},{"key":"11_CR14","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1145\/363347.363387","volume":"11","author":"K Thompson","year":"1968","unstructured":"Thompson, K.: Regular expression search algorithm. Commun. ACM 11, 419\u2013422 (1968)","journal-title":"Commun. ACM"},{"issue":"1\u20132","key":"11_CR15","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s10994-013-5409-9","volume":"96","author":"S Verwer","year":"2014","unstructured":"Verwer, S., Eyraud, R., de la Higuera, C.: PAutomaC: a probabilistic automata and hidden Markov models learning competition. Mach. Learn. 96(1\u20132), 129\u2013154 (2014)","journal-title":"Mach. Learn."},{"key":"11_CR16","doi-asserted-by":"publisher","first-page":"1013","DOI":"10.1109\/TPAMI.2005.147","volume":"27","author":"E Vidal","year":"2005","unstructured":"Vidal, E., Thollard, F., de la Higuera, C., Casacuberta, F., Carrasco, R.C.: Probabilistic finite-state machines-part I. IEEE Trans. Pattern Anal. Mach. Intell. 27, 1013\u20131025 (2005)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"11_CR17","doi-asserted-by":"publisher","first-page":"1026","DOI":"10.1109\/TPAMI.2005.148","volume":"27","author":"E Vidal","year":"2005","unstructured":"Vidal, E., Thollard, F., de la Higuera, C., Casacuberta, F., Carrasco, R.C.: Probabilistic finite-state machines-part II. IEEE Trans. Pattern Anal. Mach. Intell. 27, 1026\u20131039 (2005)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"6","key":"11_CR18","doi-asserted-by":"publisher","first-page":"402","DOI":"10.2174\/138920209789177575","volume":"10","author":"BJ Yoon","year":"2009","unstructured":"Yoon, B.J.: Hidden Markov models and their applications in biological sequence analysis. Current Genomics 10(6), 402\u2013415 (2009)","journal-title":"Current Genomics"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-94812-6_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T15:45:52Z","timestamp":1709826352000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-94812-6_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319948119","9783319948126"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-94812-6_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"29 June 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Implementation and Application of Automata","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Charlottetown, PE","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 July 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 August 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wia2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.smcs.upei.ca\/ciaa2018","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}