Computing the longest previous factor

DOI10.1016/j.ejc.2012.07.011zbMath1253.68272OpenAlexW2045095870WikidataQ61677857 ScholiaQ61677857MaRDI QIDQ1761495

Lucian Ilie, Wojciech Rytter, Costas S. Iliopoulos, Tomasz Walen, Maxime Crochemore, Marcin Kubica

Publication date: 15 November 2012

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2012.07.011

Mathematics Subject Classification ID

Combinatorics on words (68R15) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Related Items (7)

Order-preserving indexing ⋮ Longest previous overlapping factor array ⋮ Longest Gapped Repeats and Palindromes ⋮ Reverse-Safe Text Indexing ⋮ Unnamed Item ⋮ Efficient computation of longest single-arm-gapped palindromes in a string ⋮ Faster online computation of the succinct longest previous factor array

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing longest previous factor in linear time and applications
• Transducers and repetitions
• Detecting leftmost maximal periodicities
• Suffix Arrays: A New Method for On-Line String Searches
• Linear-Time Construction of Suffix Arrays
• Space Efficient Linear Time Construction of Suffix Arrays
• Linear Time Suffix Array Construction Using D-Critical Substrings
• LPF Computation Revisited
• Linear Algorithm for Data Compression via String Matching
• Data compression via textual substitution
• A Space-Economical Suffix Tree Construction Algorithm
• A universal algorithm for sequential data compression
• Compression of individual sequences via variable-rate coding
• Algorithms on Strings, Trees and Sequences
• Jewels of Stringology
• Algorithms on Strings
• Crochemore Factorization of Sturmian and Other Infinite Words

This page was built for publication: Computing the longest previous factor