最长先前非重叠因子计算

2015 26th International Workshop on Database and Expert Systems Applications (DEXA) Pub Date : 2015-09-01 DOI:10.1109/DEXA.2015.21

Supaporn Chairungsee, Tida Butrak, Surangkanang Chareonrak, Thana Charuphanthuset

{"title":"最长先前非重叠因子计算","authors":"Supaporn Chairungsee, Tida Butrak, Surangkanang Chareonrak, Thana Charuphanthuset","doi":"10.1109/DEXA.2015.21","DOIUrl":null,"url":null,"abstract":"We study the problem of finding the Longest Previous non-overlapping Factor (LPnF) occurring at each position of a string. The notion of LPnF table is a variant of the Longest Previous Factor (LPF) table and is an essential element for the design of efficient algorithms on strings. The LPnF table is related to Ziv-Lempel factorization which is used for text compression. In this paper, we describe an algorithm for computing the LPnF table of a string from its Suffix Automaton. The algorithm runs in linear time on a fixed size alphabet and applications of this algorithm are for text compression.","PeriodicalId":239815,"journal":{"name":"2015 26th International Workshop on Database and Expert Systems Applications (DEXA)","volume":"332 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Longest Previous Non-overlapping Factors Computation\",\"authors\":\"Supaporn Chairungsee, Tida Butrak, Surangkanang Chareonrak, Thana Charuphanthuset\",\"doi\":\"10.1109/DEXA.2015.21\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We study the problem of finding the Longest Previous non-overlapping Factor (LPnF) occurring at each position of a string. The notion of LPnF table is a variant of the Longest Previous Factor (LPF) table and is an essential element for the design of efficient algorithms on strings. The LPnF table is related to Ziv-Lempel factorization which is used for text compression. In this paper, we describe an algorithm for computing the LPnF table of a string from its Suffix Automaton. The algorithm runs in linear time on a fixed size alphabet and applications of this algorithm are for text compression.\",\"PeriodicalId\":239815,\"journal\":{\"name\":\"2015 26th International Workshop on Database and Expert Systems Applications (DEXA)\",\"volume\":\"332 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 26th International Workshop on Database and Expert Systems Applications (DEXA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DEXA.2015.21\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 26th International Workshop on Database and Expert Systems Applications (DEXA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DEXA.2015.21","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 8

摘要

我们研究了在字符串的每个位置找到最长前一个非重叠因子(lpf)的问题。LPF表的概念是LPF表的一种变体，是设计高效字符串算法的基本要素。lpf表与用于文本压缩的Ziv-Lempel分解有关。本文描述了一种从字符串的后缀自动机计算字符串的lpf表的算法。该算法在固定大小的字母表上以线性时间运行，应用于文本压缩。

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

查看原文本刊更多论文

Longest Previous Non-overlapping Factors Computation

We study the problem of finding the Longest Previous non-overlapping Factor (LPnF) occurring at each position of a string. The notion of LPnF table is a variant of the Longest Previous Factor (LPF) table and is an essential element for the design of efficient algorithms on strings. The LPnF table is related to Ziv-Lempel factorization which is used for text compression. In this paper, we describe an algorithm for computing the LPnF table of a string from its Suffix Automaton. The algorithm runs in linear time on a fixed size alphabet and applications of this algorithm are for text compression.

求助全文

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

来源期刊

2015 26th International Workshop on Database and Expert Systems Applications (DEXA)

自引率

0.00%

发文量