Variations of the parameterized longest previous factor
type: Item
instance of: scholarly article
title: Variations of the parameterized longest previous factor
zbMATH Open document ID: 1257.68117
author: Richard Beal
author: Donald Adjeroh
published in: Journal of Discrete Algorithms
publication date: 2013-01-18T00:00:00Z
Mathematics Subject Classification ID: 68R15
Mathematics Subject Classification ID: 68P05
zbMATH DE Number: 6126823
zbMATH Keywords: parameterized suffix array
zbMATH Keywords: parameterized longest common prefix
zbMATH Keywords: p-string
zbMATH Keywords: p-match
zbMATH Keywords: p-border array
zbMATH Keywords: LPF
zbMATH Keywords: LCP
zbMATH Keywords: permuted-LCP
zbMATH Keywords: border array
MaRDI profile type: Publication
full work available at URL: j.jda.2012.05.004
OpenAlex ID: W2046505748
cites work: Alphabet dependence in parameterized matching
cites work: A theory of parameterized pattern matching
cites work: Parameterized pattern matching: Algorithms and applications
cites work: Q4886089
cites work: Parameterized Longest Previous Factor
cites work: Parameterized longest previous factor
cites work: \(p\)-suffix sorting as arithmetic coding
cites work: Q4508365
cites work: Faster suffix tree construction with missing suffix links
cites work: Computing longest previous factor in linear time and applications
cites work: Efficient algorithms for three variants of the LPF table
cites work: Computing longest previous non-overlapping factors
cites work: Wee LCP
cites work: Algorithms on Strings, Trees and Sequences
cites work: Lightweight Parameterized Suffix Array Construction
cites work: Counting Parameterized Border Arrays for a Binary Alphabet
cites work: Verifying a Parameterized Border Array in O(n 1.5) Time
cites work: Multiple matching of parameterized patterns
cites work: Permuted Longest-Common-Prefix Array
cites work: Q4547749
cites work: Q4252748
cites work: On-line construction of parameterized suffix trees for large alphabets
cites work: Detecting leftmost maximal periodicities
cites work: Suffix Arrays: A New Method for On-Line String Searches
cites work: Algorithm Theory - SWAT 2004
cites work: Space-Time Tradeoffs for Longest-Common-Prefix Array Computation
cites work: Q4828936
cites work: On Finding Lowest Common Ancestors: Simplification and Parallelization
cites work: Generalization of a suffix tree for RNA structural pattern matching
cites work: A universal algorithm for sequential data compression
DOI: 10.1016/J.JDA.2012.05.004
description: scientific article; zbMATH DE number 6126823