{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T16:53:41Z","timestamp":1742403221108},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540422877"},{"type":"electronic","value":"9783540482246"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-48224-5_13","type":"book-chapter","created":{"date-parts":[[2007,10,28]],"date-time":"2007-10-28T06:29:04Z","timestamp":1193552944000},"page":"152-165","source":"Crossref","is-referenced-by-count":6,"title":["Hidden Pattern Statistics"],"prefix":"10.1007","author":[{"given":"Philippe","family":"Flajolet","sequence":"first","affiliation":[]},{"given":"Yves","family":"Guivarc\u2019h","sequence":"additional","affiliation":[]},{"given":"Wojciech","family":"Szpankowski","sequence":"additional","affiliation":[]},{"given":"Brigitte","family":"Vall\u00e9e","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,7,4]]},"reference":[{"key":"13_CR1","volume-title":"The Mystery of the Aleph. Mathematics, the Kabbalah, and the Search for Infinity","author":"A. Aczel","year":"2000","unstructured":"A. Aczel, The Mystery of the Aleph. Mathematics, the Kabbalah, and the Search for Infinity, Four Walls Eight Windows, New York, 2000."},{"key":"13_CR2","unstructured":"A. Apostolico and M. Atallah, Compact Recognizers of Episode Sequences, Submitted to Information and Computation."},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1006\/eujc.1993.1030","volume":"14","author":"E. Bender","year":"1993","unstructured":"E. Bender and F. Kochman, The Distribution of Subword Counts is Usually Normal, European Journal of Combinatorics, 14, 265\u2013275, 1993.","journal-title":"European Journal of Combinatorics"},{"key":"13_CR4","volume-title":"Probability and Measure","author":"P. Billingsley","year":"1986","unstructured":"P. Billingsley, Probability and Measure, Second Edition, John Wiley & Sons, New York, 1986.","edition":"Second Edition"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"L. Boasson, P. Cegielski, I. Guessarian, and Yuri Matiyasevich, Window-Accumulated Subsequence Matching Problem is Linear, In Proceedings of the Eighteenth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems: PODS 1999, ACM Press, 327\u2013336, 1999.","DOI":"10.1145\/303976.304008"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/BF02679623","volume":"29","author":"J. Cl\u00e9ment","year":"2001","unstructured":"J. Cl\u00e9ment, P. Flajolet, and B. Vall\u00e9e, Dynamical Sources in Information Theory: A General Analysis of Trie Structures, Algorithmica, 29, 307\u2013369, 2001.","journal-title":"Algorithmica"},{"key":"13_CR7","volume-title":"Text Algorithms","author":"M. Crochemore","year":"1994","unstructured":"M. Crochemore and W. Rytter, Text Algorithms, Oxford University Press, New York, 1994."},{"key":"13_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1007\/3-540-63220-4_46","volume-title":"Combinatorial Pattern Matching, 8th Annual Symposium","author":"G. Das","year":"1997","unstructured":"G. Das, R. Fleischer, L. Gasieniec, D. Gunopulos, and J. K\u00e4rkk\u00e4inen, Episode Matching, In Combinatorial Pattern Matching, 8th Annual Symposium, Lecture Notes in Computer Science vol. 1264, 12\u201327, 1997."},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/0097-3165(81)90038-8","volume":"30","author":"L. Guibas","year":"1981","unstructured":"L. Guibas and A. M. Odlyzko, Periods in Strings, J. Combinatorial Theory Ser. A, 30, 19\u201343, 1981.","journal-title":"J. Combinatorial Theory Ser. A"},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0097-3165(81)90005-4","volume":"30","author":"L. Guibas","year":"1981","unstructured":"L. Guibas and A. M. Odlyzko, String Overlaps, Pattern Matching, and Nontransitive Games, J. Combinatorial Theory Ser. A, 30, 183\u2013208, 1981.","journal-title":"J. Combinatorial Theory Ser. A"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Y. Guivarc\u2019h, Marches al\u00e9atoires sur les groupes, Fascicule de probabilit\u00e9s, Publ. Inst. Rech. Math. Rennes, 2000.","DOI":"10.1007\/978-3-0348-8968-1_19"},{"key":"13_CR12","volume-title":"Fundamental Algorithms","author":"D. E. Knuth","year":"1997","unstructured":"D. E. Knuth, The Art of Computer Programming, Fundamental Algorithms, Vol. 1, Third Edition, Addison-Wesley, Reading, MA, 1997.","edition":"Third Edition"},{"key":"13_CR13","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/S0304-3975(97)88195-9","volume":"178","author":"G. Kucherov","year":"1997","unstructured":"G. Kucherov and M. Rusinowitch, Matching a Set of Strings with Variable Length Don\u2019t Cares, Theoretical Computer Science 178, 129\u2013154, 1997.","journal-title":"Theoretical Computer Science"},{"key":"13_CR14","unstructured":"S. Kumar and E.H. Spafford, A Pattern-Matching Model for Intrusion Detection, Proceedings of the National Computer Security Conference, 11\u201321, 1994."},{"key":"13_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1007\/3-540-48481-7_18","volume-title":"European Symposium on Algorithms","author":"P. Nicod\u00e8me","year":"1999","unstructured":"P. Nicod\u00e8me, B. Salvy, and P. Flajolet, Motif Statistics, European Symposium on Algorithms, Lecture Notes in Computer Science, No. 1643, 194\u2013211, 1999."},{"key":"13_CR16","first-page":"253","volume-title":"Proc. Compression and Complexity of SEQUENCE\u201997","author":"M. R\u00e9gnier","year":"1997","unstructured":"M. R\u00e9gnier and W. Szpankowski, On the Approximate Pattern Occurrences in a Text, Proc. Compression and Complexity of SEQUENCE\u201997, IEEE Computer Society, 253\u2013264, Positano, 1997."},{"key":"13_CR17","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1007\/PL00009244","volume":"22","author":"M. R\u00e8gnier","year":"1998","unstructured":"M. R\u00e8gnier and W. Szpankowski, On Pattern Frequency Occurrences in a Markovian Sequence, Algorithmica, 22, 631\u2013649, 1998.","journal-title":"Algorithmica"},{"key":"13_CR18","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1006\/mben.2000.0151","volume":"2","author":"I. Rigoutsos","year":"2000","unstructured":"I. Rigoutsos, A. Floratos, L. Parida, Y. Gao and D. Platt, The Emergence of Pattern Discovery Techniques in Computational Biology, Metabolic Engineering, 2, 159\u2013177, 2000.","journal-title":"Metabolic Engineering"},{"key":"13_CR19","volume-title":"An Introduction to the Analysis of Algorithms","author":"R. Sedgewick","year":"1995","unstructured":"R. Sedgewick and P. Flajolet, An Introduction to the Analysis of Algorithms, Addison-Wesley, Reading, MA, 1995."},{"key":"13_CR20","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970029","volume-title":"Probability Theory and Combinatorial Optimization","author":"J. M. Steele","year":"1997","unstructured":"J. M. Steele, Probability Theory and Combinatorial Optimization, SIAM, Philadelphia, 1997."},{"key":"13_CR21","doi-asserted-by":"crossref","DOI":"10.1002\/9781118032770","volume-title":"Average Case Analysis of Algorithms on Sequences","author":"W. Szpankowski","year":"2001","unstructured":"W. Szpankowski, Average Case Analysis of Algorithms on Sequences, John Wiley & Sons, New York, 2001."},{"key":"13_CR22","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/BF02679622","volume":"29","author":"B. Vall\u00e9pe","year":"2001","unstructured":"B. Vall\u00e9pe, Dynamical Sources in Information Theory: Fundamental Intervals and Word Prefixes, Algorithmica, 29, 262\u2013306, 2001.","journal-title":"Algorithmica"},{"key":"13_CR23","doi-asserted-by":"publisher","first-page":"779","DOI":"10.1016\/S0923-2508(99)00115-1","volume":"150","author":"A. Vanet","year":"1999","unstructured":"A. Vanet, L. Marsan, and M.-F. Sagot, Promoter sequences and algorithmical methods for identifying them, Res. Microbiol., 150, 779\u2013799, 1999.","journal-title":"Res. Microbiol."},{"key":"13_CR24","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4899-6846-3","volume-title":"Introduction to Computational Biology","author":"M. Waterman","year":"1995","unstructured":"M. Waterman, Introduction to Computational Biology, Chapman and Hall, London, 1995."},{"key":"13_CR25","doi-asserted-by":"crossref","first-page":"159","DOI":"10.3233\/JCS-2000-82-305","volume":"8","author":"A. Wespi","year":"2000","unstructured":"A. Wespi, H. Debar, M. Dacier, and M. Nassehi, Fixed vs. Variable-Length Patterns For Detecting Suspicious Process Behavior, J. Computer Security, 8, 159\u2013181, 2000.","journal-title":"J. Computer Security"},{"issue":"10","key":"13_CR26","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1145\/135239.135244","volume":"35","author":"S. Wu","year":"1995","unstructured":"S. Wu and U. Manber, Fast Text Searching Allowing Errors, Comm. ACM, 35:10, 83\u2013991, 1995.","journal-title":"Comm. ACM"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48224-5_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T02:28:26Z","timestamp":1556936906000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48224-5_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540422877","9783540482246"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-48224-5_13","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}