Supaporn Chairungsee, Tida Butrak, Surangkanang Chareonrak, Thana Charuphanthuset
{"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}
引用次数: 8
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
