...
首页> 外文期刊>Information Processing Letters >A bisection algorithm for grammar-based compression of ordered trees
【24h】

A bisection algorithm for grammar-based compression of ordered trees

机译:一种基于二分法的基于语法的有序树压缩

获取原文
获取原文并翻译 | 示例
   

获取外文期刊封面封底 >>

       

摘要

In this paper, we consider grammar-based compression for rooted ordered trees. For that purpose, we define an elementary ordered tree grammar (EOTG) by extending CFG, and then present a polynomial time algorithm which approximates the smallest EOTG within a factor of O(n~(5/6)). We also show that the grammar and algorithm can be modified for unordered trees of bounded degree.
机译:在本文中,我们考虑对有序有序树进行基于语法的压缩。为此,我们通过扩展CFG定义基本有序树语法(EOTG),然后提出一种多项式时间算法,该算法在O(n〜(5/6))因子内近似最小的EOTG。我们还表明,可以对有界度的无序树进行语法和算法修改。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号