Variations of the parameterized longest previous factor

DOI10.1016/J.JDA.2012.05.004zbMath1257.68117OpenAlexW2046505748MaRDI QIDQ1932360

Richard Beal, Donald A. Adjeroh

Publication date: 18 January 2013

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2012.05.004

zbMATH Keywords

p-matchp-stringLCPborder arrayLPFparameterized longest common prefixparameterized suffix arrayp-border arraypermuted-LCP

Mathematics Subject Classification ID

Combinatorics on words (68R15) Data structures (68P05)

Related Items (3)

Compressed parameterized pattern matching ⋮ A prefix array for parameterized strings ⋮ A brief history of parameterized matching problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient algorithms for three variants of the LPF table
• Parameterized longest previous factor
• 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
• Parameterized pattern matching: Algorithms and applications
• \(p\)-suffix sorting as arithmetic coding
• On-line construction of parameterized suffix trees for large alphabets
• Computing longest previous non-overlapping factors
• Parameterized Longest Previous Factor
• Suffix Arrays: A New Method for On-Line String Searches
• Faster suffix tree construction with missing suffix links
• Verifying a Parameterized Border Array in O(n 1.5) Time
• Space-Time Tradeoffs for Longest-Common-Prefix Array Computation
• Counting Parameterized Border Arrays for a Binary Alphabet
• Permuted Longest-Common-Prefix Array
• Lightweight Parameterized Suffix Array Construction
• On Finding Lowest Common Ancestors: Simplification and Parallelization
• A universal algorithm for sequential data compression
• Algorithms on Strings, Trees and Sequences
• A theory of parameterized pattern matching
• Algorithm Theory - SWAT 2004

This page was built for publication: Variations of the parameterized longest previous factor