Parameterized longest previous factor

DOI10.1016/J.TCS.2012.02.004zbMATH Open1247.68331OpenAlexW2028886091MaRDI QIDQ441845FDOQ441845

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

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

zbMATH Keywords

p-matchp-stringLCPLPFparameterized longest common prefixparameterized suffix array

Mathematics Subject Classification ID

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

Cites Work

• Efficient string matching
• Algorithms on Strings, Trees and Sequences
• Title not available (Why is that?)
• A universal algorithm for sequential data compression
• Suffix Arrays: A New Method for On-Line String Searches
• On-line construction of parameterized suffix trees for large alphabets
• Faster Suffix Tree Construction with Missing Suffix Links
• Permuted Longest-Common-Prefix Array
• Detecting leftmost maximal periodicities
• Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays
• Alphabet dependence in parameterized matching
• Generalization of a suffix tree for RNA structural pattern matching
• p-suffix sorting as arithmetic coding
• LPF computation revisited
• Lightweight parameterized suffix array construction
• Title not available (Why is that?)
• Title not available (Why is that?)
• A theory of parameterized pattern matching
• Multiple matching of parameterized patterns
• Computing longest previous factor in linear time and applications
• Algorithm Theory - SWAT 2004
• Computing longest previous non-overlapping factors
• Parameterized longest previous factor
• Space-Time Tradeoffs for Longest-Common-Prefix Array Computation
• Wee LCP

Cited In (10)

• The structural border array
• Towards a real time algorithm for parameterized longest common prefix computation
• Variations of the parameterized longest previous factor
• Parameterized longest previous factor
• \(p\)-suffix sorting as arithmetic coding
• Compressed parameterized pattern matching
• Computing the longest previous factor
• A brief history of parameterized matching problems
• 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)