A brief history of parameterized matching problems
From MaRDI portal
Publication:2295633
Recommendations
Cites work
- p-suffix sorting as arithmetic coding
- A data structure for dynamic trees
- A fast string searching algorithm
- A framework for dynamic parameterized dictionary matching
- A prefix array for parameterized strings
- A Space-Economical Suffix Tree Construction Algorithm
- A theory of parameterized pattern matching
- A universal algorithm for sequential data compression
- Algorithms For Computing Approximate Repetitions In Musical Sequences
- Algorithms for Computing the Longest Parameterized Common Subsequence
- Algorithms on Strings, Trees and Sequences
- Algorithms – ESA 2004
- Alphabet dependence in parameterized matching
- Approximate parameterized matching
- Bit-parallel (\(\delta ,\gamma\))-matching and suffix automata
- Border Array for Structural Strings
- Comparison and evaluation of code clone detection techniques and tools: A qualitative approach
- Compressed parameterized pattern matching
- Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String 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
- Efficient parameterized string matching
- Efficient pattern matching for RNA secondary structures
- Fast Pattern Matching in Strings
- Faster Suffix Tree Construction with Missing Suffix Links
- Frequency-based similarity for parameterized sequences: formal framework, algorithms, and applications
- Generalization of a suffix tree for RNA structural pattern matching
- Generalized function matching
- scientific article; zbMATH DE number 1615278 (Why is no real title available?)
- scientific article; zbMATH DE number 6678937 (Why is no real title available?)
- scientific article; zbMATH DE number 2185648 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 1305486 (Why is no real title available?)
- scientific article; zbMATH DE number 1306895 (Why is no real title available?)
- scientific article; zbMATH DE number 1954383 (Why is no real title available?)
- scientific article; zbMATH DE number 1998335 (Why is no real title available?)
- scientific article; zbMATH DE number 2038765 (Why is no real title available?)
- scientific article; zbMATH DE number 910912 (Why is no real title available?)
- Indexing compressed text
- Lightweight parameterized suffix array construction
- Multiple matching of parameterized patterns
- On the longest common parameterized subsequence
- On-line construction of parameterized suffix trees for large alphabets
- Order preserving pattern matching on trees and DAGs
- p-suffix sorting as arithmetic coding
- Parameterized Duplication in Strings: Algorithms and an Application to Software Maintenance
- Parameterized longest previous factor
- Parameterized longest previous factor
- Parameterized matching on non-linear structures
- Parameterized matching with mismatches
- Parameterized searching with mismatches for run-length encoded strings
- pBWT: achieving succinct data structures for parameterized pattern matching and related problems
- Periodicity and repetitions in parameterized strings
- Permuted function matching
- Space-efficient dictionaries for parameterized and order-preserving pattern matching
- Speeding up two string-matching algorithms
- Structural Pattern Matching - Succinctly.
- Suffix Arrays: A New Method for On-Line String Searches
- The equation \(a_ M=b^ Nc^ P\) in a free group
- The smallest automaton recognizing the subwords of a text
- The structural border array
- Two-dimensional parameterized matching
- Uniqueness Theorems for Periodic Functions
- Variations of the parameterized longest previous factor
- Verifying and enumerating parameterized border arrays
Cited in
(8)- Parameterized DAWGs: efficient constructions and bidirectional pattern searches
- The parameterized suffix tray
- Computing the parameterized Burrows-Wheeler transform online
- Efficient parameterized pattern matching in sublinear space
- Breaking a barrier in constructing compact indexes for parameterized pattern matching
- Inverting parameterized Burrows-Wheeler transform
- LF successor: compact space indexing for order-isomorphic pattern matching
- Parameterized matching on non-linear structures
This page was built for publication: A brief history of parameterized matching problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2295633)
