Variations of the parameterized longest previous factor

DOI10.1016/J.JDA.2012.05.004MaRDI QIDQ1932360zbMATH OpenOpenAlexFDO

Authors Richard Beal, Donald 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

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

Recommendations

• Parameterized longest previous factor
• Parameterized longest previous factor
• Efficient algorithms for three variants of the LPF table
• Computing longest previous factor in linear time and applications
• Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays

Cites work

• scientific article; zbMATH DE number 1306895 (Why is no real title available?)
• scientific article; zbMATH DE number 1512678 (Why is no real title available?)
• scientific article; zbMATH DE number 1786458 (Why is no real title available?)
• scientific article; zbMATH DE number 2119665 (Why is no real title available?)
• scientific article; zbMATH DE number 910912 (Why is no real title available?)
• A theory of parameterized pattern matching
• A universal algorithm for sequential data compression
• Algorithm Theory - SWAT 2004
• Algorithms on Strings, Trees and Sequences
• Alphabet dependence in parameterized matching
• Computing longest previous factor in linear time and applications
• Computing longest previous non-overlapping factors
• Counting Parameterized Border Arrays for a Binary Alphabet
• Detecting leftmost maximal periodicities
• Efficient algorithms for three variants of the LPF table
• Faster suffix tree construction with missing suffix links
• Generalization of a suffix tree for RNA structural pattern matching
• Lightweight parameterized suffix array construction
• Multiple matching of parameterized patterns
• On Finding Lowest Common Ancestors: Simplification and Parallelization
• On-line construction of parameterized suffix trees for large alphabets
• Parameterized longest previous factor
• Parameterized longest previous factor
• Parameterized pattern matching: Algorithms and applications
• Permuted Longest-Common-Prefix Array
• Space-Time Tradeoffs for Longest-Common-Prefix Array Computation
• Suffix Arrays: A New Method for On-Line String Searches
• Verifying a parameterized border array in \(O(n ^{1.5})\) time
• Wee LCP
• \(p\)-suffix sorting as arithmetic coding

Cited in

(7)

• Parameterized longest previous factor
• A brief history of parameterized matching problems
• Compressed parameterized pattern matching
• Computing the longest previous factor
• Direct linear time construction of parameterized suffix and LCP arrays for constant alphabets
• Parameterized longest previous factor
• A prefix array for parameterized strings

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1932360)