Parameterized longest previous factor

DOI10.1016/J.TCS.2012.02.004MaRDI QIDQ441845zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

p-matchp-stringLCPLPFparameterized longest common prefixparameterized suffix array

Mathematics Subject Classification ID

Data structures (68P05) Algorithms on strings (68W32)

Recommendations

• Parameterized longest previous factor
• Variations of the parameterized longest previous factor
• Computing longest previous factor in linear time and applications
• Efficient algorithms for three variants of the LPF table
• Computing the longest previous factor

Cites work

• scientific article; zbMATH DE number 1306895 (Why is no real title available?)
• scientific article; zbMATH DE number 1786458 (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
• Detecting leftmost maximal periodicities
• Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays
• Efficient string matching
• Faster Suffix Tree Construction with Missing Suffix Links
• Generalization of a suffix tree for RNA structural pattern matching
• LPF computation revisited
• Lightweight parameterized suffix array construction
• Multiple matching of parameterized patterns
• On-line construction of parameterized suffix trees for large alphabets
• Parameterized longest previous factor
• Permuted Longest-Common-Prefix Array
• Space-Time Tradeoffs for Longest-Common-Prefix Array Computation
• Suffix Arrays: A New Method for On-Line String Searches
• Wee LCP
• p-suffix sorting as arithmetic coding

Cited in

(10)

• Variations of the parameterized longest previous factor
• The structural border array
• Parameterized longest previous factor
• A brief history of parameterized matching problems
• Compressed parameterized pattern matching
• Towards a real time algorithm for parameterized longest common prefix computation
• Computing the longest previous factor
• \(p\)-suffix sorting as arithmetic coding
• Efficient pattern matching for RNA secondary structures
• A prefix array for parameterized strings

This page was built for publication: Parameterized longest previous factor

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