Efficient algorithms for three variants of the LPF table
DOI10.1016/J.JDA.2011.02.002zbMATH Open1252.68358OpenAlexW2062386565MaRDI QIDQ414447FDOQ414447
Authors: Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Wojciech Rytter, Tomasz Waleń 
Publication date: 11 May 2012
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2011.02.002
Recommendations
- Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays
- scientific article; zbMATH DE number 916038
- Faster algorithms for solving LPN
- Efficient algorithms for computing the $L_2$-discrepancy
- An efficient algorithm for 3NF determination
- An efficient algorithm for solving a special class of LP's
- An Improved LPN Algorithm
- Algorithm Theory - SWAT 2004
- Linear-space S-table algorithms for the longest common subsequence problem
runspalindromesuffix arraylongest previous factorlongest previous non-overlapping factorlongest previous non-overlapping reverse factorlongest previous reverse factortext compression
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Algorithms on strings (68W32)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A universal algorithm for sequential data compression
- Suffix Arrays: A New Method for On-Line String Searches
- Succinct data structures for flexible text retrieval systems
- Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE
- Algorithms on Strings
- Transducers and repetitions
- Space efficient linear time construction of suffix arrays
- A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array
- Detecting leftmost maximal periodicities
- Title not available (Why is that?)
- Linear-time construction of suffix arrays (extended abstract)
- Linear Time Suffix Array Construction Using D-Critical Substrings
- A New Linear-Time ``On-Line Algorithm for Finding the Smallest Initial Palindrome of a String
- Lempel-Ziv factorization using less time \& space
- LPF computation revisited
- Title not available (Why is that?)
- Computing longest previous factor in linear time and applications
- Searching for Gapped Palindromes
- Title not available (Why is that?)
- Algorithmic aspects of bioinformatics. Translated from the German original
Cited In (15)
- Reversing longest previous factor tables is hard
- On parsing optimality for dictionary-based text compression -- the \texttt{Zip} case
- Parameterized longest previous factor
- Variations of the parameterized longest previous factor
- Computing longest previous factor in linear time and applications
- LPF computation revisited
- Parameterized longest previous factor
- Note on the greedy parsing optimality for dictionary-based text compression
- Longest previous overlapping factor array
- A Linear-Time Algorithm for Seeds Computation
- Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays
- Computing longest previous non-overlapping factors
- A brief history of parameterized matching problems
- A prefix array for parameterized strings
- On the computation of longest previous non-overlapping factors
This page was built for publication: Efficient algorithms for three variants of the LPF table
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q414447)
