Show simple item record

dc.contributor.authorCrochemore, M.
dc.contributor.authorIliopoulos, Costas
dc.contributor.authorKubica, M.
dc.contributor.authorRytter, W.
dc.contributor.authorWalen, T.
dc.contributor.editorJan v Leeuwen, Anca Muscholl, David Peleg, Jaroslav Pokorny and Bernhard Rumpe
dc.date.accessioned2017-01-30T12:14:00Z
dc.date.available2017-01-30T12:14:00Z
dc.date.created2015-03-03T20:13:40Z
dc.date.issued2010
dc.identifier.citationCrochemore, M. and Iliopoulos, C. and Kubica, M. and Rytter, W. and Walen, T. 2010. Efficient algorithms for two extensions of LPF table: the power of suffix arrays, in Jan v Leeuwen, Anca Muscholl, David Peleg, Jaroslav Pokorny and Bernhard Rumpe (ed), 36th Conference on Current Trends in Theory and Practice of Computer Science,, Jan 23 2010, pp. 296-307. Spindleruv Mlyn, Czech Republic: Springer.
dc.identifier.urihttp://hdl.handle.net/20.500.11937/19459
dc.identifier.doi10.1007/978-3-642-11266-9_25
dc.description.abstract

Su?x arrays provide a powerful data structure to solve several questions related to the structure of all the factors of a string. We show how they can be used to compute e?ciently two new tables storing di?erent types of previous factors (past segments) of a string. The concept of a longest previous factor is inherent to Ziv-Lempel factorization of strings in text compression, as well as in statistics of repetitions and symmetries. The longest previous reverse factor for a given position i is the longest factor starting at i, such that its reverse copy occurs before, while the longest previous non-overlapping factor is the longest factor v starting at i which has an exact copy occurring before. The previous copies of the factors are required to occur in the pre?x ending at position i -1. We design algorithms computing the table of longest previous reverse factors (LPrF table) and the table of longest previous nonoverlapping factors (LPnF table). The latter table is useful to computerepetitions while the former is a useful tool for extracting symmetries. These tables are computed, using two previously computed read-only arrays (SUF and LCP) composing the su?x array, in linear time on anyinteger alphabet. The tables have not been explicitly considered before, but they have several applications and they are natural extensions of the LPF table which has been studied thoroughly before. Our results improve on the previous ones in several ways. The running time of the computation no longer depends on the size of the alphabet, which drops a log factor. Moreover the newly introduced tables store additional information on the structure of the string, helpful to improve, for example, gapped palindrome detection and text compression using reverse factors. computing their primitive roots. Applications of runs, despite their importance, are underrepresented in existing literature (approximately one page in the paper of Kolpakov & Kucherov, 1999). In this paper we attempt to ?ll in this gap. We use Lyndon words and introduce the Lyndon structure of runs as a useful tool when computing powers. In problems related to periods we use some versions of the Manhattan skyline problem.

dc.publisherSpringer
dc.relation.urihttp://www.springerlink.com/content/5177t4t8k4m66112
dc.subjectSu?x Array
dc.subjectLongest previous reverse factor
dc.subjectlongest previous factor
dc.subjectlongest previous non-overlapping factor
dc.subjectruns
dc.subjectpalindrome
dc.subjecttext compression
dc.titleEfficient algorithms for two extensions of LPF table: the power of suffix arrays
dc.typeConference Paper
dcterms.source.startPage296
dcterms.source.endPage307
dcterms.source.titleLecture notes in computer science, volume 5091: theory and practice of computer science - SOFSEM 2010
dcterms.source.seriesLecture notes in computer science, volume 5091: theory and practice of computer science - SOFSEM 2010
dcterms.source.isbn978-364205005-3
dcterms.source.conference36th Conference on Current Trends in Theory and Practice of Computer Science,
dcterms.source.conference-start-dateJan 23 2010
dcterms.source.conferencelocationSpindleruv Mlyn, Czech Republic
dcterms.source.placeHeidelberg
curtin.departmentDigital Ecosystems and Business Intelligence Institute (DEBII)
curtin.accessStatusFulltext not available


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record