{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:40:29Z","timestamp":1725514829762},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540690665"},{"type":"electronic","value":"9783540690689"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-69068-9_12","type":"book-chapter","created":{"date-parts":[[2008,6,7]],"date-time":"2008-06-07T05:54:28Z","timestamp":1212818068000},"page":"107-117","source":"Crossref","is-referenced-by-count":1,"title":["Analysis of the Size of Antidictionary in DCA"],"prefix":"10.1007","author":[{"given":"Julien","family":"Fayolle","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198522355.001.0001","volume-title":"Poisson approximation","author":"A.D. Barbour","year":"1992","unstructured":"Barbour, A.D., Holst, L., Janson, S.: Poisson approximation. The Clarendon Press Oxford University Press, New York (1992) (Oxford Science Publications)"},{"key":"12_CR2","series-title":"Lecture Notes in Computer Science","volume-title":"STACS 96","author":"M.-P. B\u00e9al","year":"1996","unstructured":"B\u00e9al, M.-P., Mignosi, F., Restivo, A.: Minimal forbidden words and symbolic dynamics. In: Puech, C., Reischuk, R. (eds.) STACS 1996. LNCS, vol.\u00a01046. Springer, Heidelberg (1996)"},{"key":"12_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/3-540-48523-6_23","volume-title":"Automata, Languages and Programming","author":"M. Crochemore","year":"1999","unstructured":"Crochemore, M., Mignosi, F., Restivo, A., Salemi, S.: Text compression using antidictonaries. In: Wiedermann, J., Van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol.\u00a01644, pp. 261\u2013270. Springer, Heidelberg (1999)"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Crochemore, M., Mignosi, F., Restivo, A., Salemi, S.: Data compression using antidictonaries. In: Storer, J. (ed.) Proceedings of the I.E.E.E., Lossless Data Compression, pp. 1756\u20131768 (2000)","DOI":"10.1109\/5.892711"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Crochemore, M., Navarro, G.: Improved antidictionary based compression. In: SCCC 2002, Chilean Computer Science Society, pp. 7\u201313. I.E.E.E. CS Press (November 2002)","DOI":"10.1109\/SCCC.2002.1173168"},{"key":"12_CR6","first-page":"217","volume-title":"Mathematics and Computer Science","author":"J. Fayolle","year":"2004","unstructured":"Fayolle, J.: An average-case analysis of basic parameters of the suffix tree. In: Drmota, M., Flajolet, P., Gardy, D., Gittenberger, B. (eds.) Mathematics and Computer Science. Proceedings of a colloquium organized by TU, Wien, Vienna, Austria, pp. 217\u2013227. Birkh\u00e4user, Basel (2004)"},{"key":"12_CR7","unstructured":"Fayolle, J.: Compression de donn\u00e9es sans perte et combinatoire analytique. PhD thesis, Universit\u00e9 Paris VI (2006)"},{"key":"12_CR8","unstructured":"Fayolle, J., Ward, M.D.: Analysis of the average depth in a suffix tree under a Markov model. In: Proceedings of the 2005 International Conference on the Analysis of Algorithms (2005), DMTCS. Proceedings of a colloquium organized by Universitat Polit\u00e8cnica de Catalunya, Barcelona, Catalunya, June 2005, pp. 95\u2013104 (2005)"},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0304-3975(95)00002-E","volume":"144","author":"P. Flajolet","year":"1995","unstructured":"Flajolet, P., Gourdon, X., Dumas, P.: Mellin transforms and asymptotics: Harmonic sums. Theoretical Computer Science\u00a0144, (1\u20132), 3\u201358 (1995)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"12_CR10","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0097-3165(94)90065-5","volume":"66","author":"P. Jacquet","year":"1994","unstructured":"Jacquet, P., Szpankowski, W.: Autocorrelation on words and its applications: analysis of suffix trees by string-ruler approach. Journal of Combinatorial Theory. Series A\u00a066(2), 237\u2013269 (1994)","journal-title":"Journal of Combinatorial Theory. Series A"},{"key":"12_CR11","unstructured":"Morita, H., Ota, T.: An upper bound on size of antidictionary. In: Proceedings of SITA 2004 (2004)"},{"key":"12_CR12","first-page":"1187","volume":"9","author":"T. Ota","year":"2004","unstructured":"Ota, T., Morita, H.: One-path ECG lossless compression using antidictionaries. IEICE Trans. Fundamentals (Japanese Edition) J87-A\u00a09, 1187\u20131195 (2004)","journal-title":"IEICE Trans. Fundamentals (Japanese Edition) J87-A"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69068-9_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,27]],"date-time":"2024-02-27T06:02:14Z","timestamp":1709013734000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69068-9_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540690665","9783540690689"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69068-9_12","relation":{},"subject":[]}}