On finding lowest common ancestors: simplification and parallelization
SIAM Journal on Computing
Detecting leftmost maximal periodicities
Discrete Applied Mathematics - Combinatorics and complexity
Suffix arrays: a new method for on-line string searches
SIAM Journal on Computing
A theory of parameterized pattern matching: algorithms and applications
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Alphabet dependence in parameterized matching
Information Processing Letters
Multiple matching of parameterized patterns
Theoretical Computer Science
Parameterized pattern matching: algorithms and applications
Journal of Computer and System Sciences
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
Parameterized pattern matching by Boyer-Moore-type algorithms
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Faster suffix tree construction with missing suffix links
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Succinct representations of lcp information and improvements in the compressed suffix arrays
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
LATIN '00 Proceedings of the 4th Latin American Symposium on Theoretical Informatics
Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications
CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
DNA Sequence Compression Using the Burrows-Wheeler Transform
CSB '02 Proceedings of the IEEE Computer Society Conference on Bioinformatics
Faster algorithms for the construction of parameterized suffix trees
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Locating All Tandem Repeat Families in a Sequence
CSB '04 Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference
Finding Clones with Dup: Analysis of an Experiment
IEEE Transactions on Software Engineering
Computing Longest Previous Factor in linear time and applications
Information Processing Letters
A Simple Algorithm for Computing the Lempel Ziv Factorization
DCC '08 Proceedings of the Data Compression Conference
The Burrows-Wheeler Transform: Data Compression, Suffix Arrays, and Pattern Matching
The Burrows-Wheeler Transform: Data Compression, Suffix Arrays, and Pattern Matching
Space-Time Tradeoffs for Longest-Common-Prefix Array Computation
ISAAC '08 Proceedings of the 19th International Symposium on Algorithms and Computation
Counting Parameterized Border Arrays for a Binary Alphabet
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Textual data compression in computational biology
Bioinformatics
Permuted Longest-Common-Prefix Array
CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
On-Line Construction of Parameterized Suffix Trees
SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval
Information Processing Letters
Verifying a parameterized border array in O(n1.5) time
CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
IEEE Spectrum
On-line construction of parameterized suffix trees for large alphabets
Information Processing Letters
Computing Longest Previous non-overlapping Factors
Information Processing Letters
Efficient algorithms for three variants of the LPF table
Journal of Discrete Algorithms
Parameterized longest previous factor
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
Parameterized longest previous factor
Theoretical Computer Science
A universal algorithm for sequential data compression
IEEE Transactions on Information Theory
p-Suffix sorting as arithmetic coding
Journal of Discrete Algorithms
Proceedings of the International Conference on Bioinformatics, Computational Biology and Biomedical Informatics
| Hi-index | 0.00 |
The parameterized longest previous factor (pLPF) problem as defined for parameterized strings (p-strings) adds a level of parameterization to the longest previous factor (LPF) problem originally defined for traditional strings. In this work, we consider the construction of the pLPF data structure and identify the strong relationship between the pLPF linear time construction and several variations of the problem. Initially, we propose a taxonomy of classes for longest factor problems. Using this taxonomy, we show an interesting connection between the pLPF and popular data structures. It is shown that a subset of longest factor problems may be created with the pLPF construction. More specifically, the pLPF problem is used as a foundation to achieve the linear time construction of popular data structures such as the LCP, parameterized-LCP (pLCP), parameterized-border (p-border) array, and border array. We further generalize the permuted-LCP for p-strings and provide a linear time construction. A number of new variations of the pLPF problem are proposed and addressed in linear time for both p-strings and traditional strings, including the longest not-equal factor (LneF), longest reverse factor (LrF), and longest factor (LF). The framework of the pLPF construction is exploited to efficiently address a multitude of data structures with prospects in various applications. Finally, we implement our algorithms and perform various experiments to confirm theoretical results.