后缀数组的熵估计

... Proceedings of the ... IEEE International Conference on Progress in Informatics and Computing. IEEE International Conference on Progress in Informatics and Computing Pub Date : 2012-03-01 DOI:10.2201/NIIPI.2012.9.4

K. Sadakane

{"title":"后缀数组的熵估计","authors":"K. Sadakane","doi":"10.2201/NIIPI.2012.9.4","DOIUrl":null,"url":null,"abstract":"In this paper we give an algorithmfor estimatingthe entropyofa string using the suffix array. Our algorithm is based on a new combinatorial property of the longest common prefix array of a string.","PeriodicalId":91638,"journal":{"name":"... Proceedings of the ... IEEE International Conference on Progress in Informatics and Computing. IEEE International Conference on Progress in Informatics and Computing","volume":"156 3","pages":"19"},"PeriodicalIF":0.0000,"publicationDate":"2012-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Entropy estimation with suffix arrays\",\"authors\":\"K. Sadakane\",\"doi\":\"10.2201/NIIPI.2012.9.4\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we give an algorithmfor estimatingthe entropyofa string using the suffix array. Our algorithm is based on a new combinatorial property of the longest common prefix array of a string.\",\"PeriodicalId\":91638,\"journal\":{\"name\":\"... Proceedings of the ... IEEE International Conference on Progress in Informatics and Computing. IEEE International Conference on Progress in Informatics and Computing\",\"volume\":\"156 3\",\"pages\":\"19\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"... Proceedings of the ... IEEE International Conference on Progress in Informatics and Computing. IEEE International Conference on Progress in Informatics and Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2201/NIIPI.2012.9.4\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"... Proceedings of the ... IEEE International Conference on Progress in Informatics and Computing. IEEE International Conference on Progress in Informatics and Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2201/NIIPI.2012.9.4","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

本文给出了一种利用后缀数组估计字符串熵的算法。我们的算法是基于字符串的最长公共前缀数组的一个新的组合属性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Entropy estimation with suffix arrays

In this paper we give an algorithmfor estimatingthe entropyofa string using the suffix array. Our algorithm is based on a new combinatorial property of the longest common prefix array of a string.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

... Proceedings of the ... IEEE International Conference on Progress in Informatics and Computing. IEEE International Conference on Progress in Informatics and Computing

自引率

0.00%

发文量

期刊最新文献

A convolutional neural network based approach towards real-time hard hat detection Report on the analyses and the applications of a large-scale news video archive: NII TV-RECS Large-scale cross-media analysis and mining from socially curated contents Scalable Approaches for Content -based Video Retrieval 湘南会議 The future of multimedia analysis and mining