A prefix array for parameterized strings
From MaRDI portal
Publication:511148
DOI10.1016/J.JDA.2016.11.002zbMATH Open1359.68329OpenAlexW2552773400MaRDI QIDQ511148FDOQ511148
Richard Beal, Donald Adjeroh, W. F. Smyth
Publication date: 14 February 2017
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2016.11.002
p-matchp-stringchpPAcompact parameterized prefix arraycpPAhp-matchhp-stringparameterized longest previous factorparameterized prefix arrayparameterized string with holespLPFpPA
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algorithms on Strings, Trees and Sequences
- On-line construction of parameterized suffix trees for large alphabets
- Generalized function matching
- An O(n log n) algorithm for finding all repetitions in a string
- Approximate parameterized matching
- Faster Suffix Tree Construction with Missing Suffix Links
- Algorithms on Strings
- Inferring an indeterminate string from a prefix graph
- Prefix Table Construction and Conversion
- Indeterminate strings, prefix arrays \& undirected graphs
- Algorithmic Combinatorics on Partial Words
- Fast pattern-matching on indeterminate strings
- Efficient parameterized string matching
- Alphabet dependence in parameterized matching
- Generalization of a suffix tree for RNA structural pattern matching
- \(p\)-suffix sorting as arithmetic coding
- Verifying a Parameterized Border Array in O(n 1.5) Time
- Counting Parameterized Border Arrays for a Binary Alphabet
- Lightweight Parameterized Suffix Array Construction
- The structural border array
- Efficient algorithms for three variants of the LPF table
- Parameterized longest previous factor
- A theory of parameterized pattern matching
- Multiple matching of parameterized patterns
- Parameterized searching with mismatches for run-length encoded strings
- Parameterized matching with mismatches
- Computing longest previous factor in linear time and applications
- Computing longest previous non-overlapping factors
- Efficient pattern matching for RNA secondary structures
- Variations of the parameterized longest previous factor
- New Bounds and Extended Relations Between Prefix Arrays, Border Arrays, Undirected Graphs, and Indeterminate Strings
- IDENTIFYING RHYTHMS IN MUSICAL TEXTS
Cited In (1)
This page was built for publication: A prefix array for parameterized strings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q511148)
