Parameterized longest previous factor
From MaRDI portal
Publication:441845
DOI10.1016/J.TCS.2012.02.004zbMath1247.68331OpenAlexW2028886091MaRDI QIDQ441845
Richard Beal, Donald A. Adjeroh
Publication date: 8 August 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.02.004
Related Items (7)
The structural border array ⋮ Variations of the parameterized longest previous factor ⋮ \(p\)-suffix sorting as arithmetic coding ⋮ Compressed parameterized pattern matching ⋮ Efficient pattern matching for RNA secondary structures ⋮ A prefix array for parameterized strings ⋮ A brief history of parameterized matching problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multiple matching of parameterized patterns
- Computing longest previous factor in linear time and applications
- Wee LCP
- Alphabet dependence in parameterized matching
- Detecting leftmost maximal periodicities
- Generalization of a suffix tree for RNA structural pattern matching
- On-line construction of parameterized suffix trees for large alphabets
- Computing longest previous non-overlapping factors
- Parameterized Longest Previous Factor
- p-Suffix Sorting as Arithmetic Coding
- Suffix Arrays: A New Method for On-Line String Searches
- Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays
- Space-Time Tradeoffs for Longest-Common-Prefix Array Computation
- Permuted Longest-Common-Prefix Array
- LPF Computation Revisited
- Lightweight Parameterized Suffix Array Construction
- Efficient string matching
- A universal algorithm for sequential data compression
- Algorithms on Strings, Trees and Sequences
- Faster Suffix Tree Construction with Missing Suffix Links
- A theory of parameterized pattern matching
- Algorithm Theory - SWAT 2004
This page was built for publication: Parameterized longest previous factor
