An Online Algorithm for Finding the Longest Previous Factors

DOI10.1007/978-3-540-87744-8_58zbMath1158.68556OpenAlexW1525445671MaRDI QIDQ3541131

Daisuke Okanohara, Kunihiko Sadakane

Publication date: 25 November 2008

Published in: Algorithms - ESA 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-87744-8_58

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Searching and sorting (68P10) Data structures (68P05)

Related Items

Faster Lightweight Lempel-Ziv Parsing, On compressing and indexing repetitive sequences, Lempel-Ziv Factorization Revisited, Computing regularities in strings: a survey, Towards optimal range medians, Faster online computation of the succinct longest previous factor array, Lazy Lempel-Ziv Factorization Algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Replacing suffix trees with enhanced suffix arrays
• Computing longest previous factor in linear time and applications
• Compressed suffix trees with full functionality
• Compressed representations of sequences and full-text indexes
• Compressed indexes for dynamic text collections
• Suffix Arrays: A New Method for On-Line String Searches
• Dynamic Rank-Select Structures with Applications to Run-Length Encoded Texts
• Fast and Practical Algorithms for Computing All the Runs in a String
• A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array
• A universal algorithm for sequential data compression
• Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE