Research exposition (monographs, survey articles) pertaining to computer science (68-02) Formal languages and automata (68Q45) Analysis of algorithms (68W40) Searching and sorting (68P10) Nonnumerical algorithms (68W05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Combinatorics on words (68R15) Parallel algorithms in computer science (68W10) Computing methodologies for text processing; mathematical typography (68U15)
Recommendations
Cited in
(only showing first 100 items - show all)- Linear-time construction of two-dimensional suffix trees
- Efficient and secure generalized pattern matching via Fast Fourier Transform
- Spaces, trees, and colors: the algorithmic landscape of document retrieval on sequences
- Minimal forbidden subwords
- Computing the longest previous factor
- BLIM: A new bit-parallel pattern matching algorithm overcoming computer word size limitation
- On-line construction of compact directed acyclic word graphs
- Longest common extensions with wildcards: trade-off and applications
- On finding longest palindromic subsequences using longest common subsequences
- Validating the Knuth-Morris-Pratt failure function, fast and online
- Longest unbordered factor in quasilinear time
- String periods in the order-preserving model
- Non-expandable non-overlapping sets of pictures
- Linear-size CDAWG: new repetition-aware indexing and grammar compression
- Unbordered partial words
- An Extension of the Lyndon Schützenberger Result to Pseudoperiodic Words
- Fast algorithm for partial covers in words
- Computing the number of cubic runs in standard Sturmian words
- Simple tree pattern matching for trees in the prefix bar notation
- Compressed Multiple Pattern Matching
- Indexing factors with gaps
- Efficient seeds computation revisited
- Scalability and communication in parallel low-complexity lossless compression
- Algorithmic techniques for the polymer sciences
- Longest repeats with a block of \(k\) don't cares
- Order-preserving matching
- Distance measures for biological sequences: some recent approaches
- Multidimensional term indexing for efficient processing of complex queries
- Freeness of partial words
- Equations on partial words
- Detecting one-variable patterns
- The number of runs in a string
- Languages with mismatches
- On the maximum number of cubic subwords in a word
- Solving string problems on graphs using the labeled direct product
- Operation insertion on the conjugacy and commutativity of words
- LZ-End Parsing in Linear Time
- scientific article; zbMATH DE number 2131247 (Why is no real title available?)
- An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence
- Sturmian and Episturmian Words
- Functional programs as compressed data
- Efficient algorithms for shortest partial seeds in words
- Efficient seed computation revisited
- Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails
- New simple efficient algorithms computing powers and runs in strings
- Unbordered pictures: properties and construction
- Optimal prefix and suffix queries on texts
- Computing the Antiperiod(s) of a String
- Watson-Crick Conjugate and Commutative Words
- Disjunctivity and other properties of sets of pseudo-bordered words
- Sets of pictures avoiding overlaps
- Universal reconstruction of a string
- The greedy approach to dictionary-based static text compression on a distributed system
- Palindromic decompositions with gaps and errors
- Universal reconstruction of a string
- On new algorithms of mutual transformation of string schemes
- Polynomial-time approximation algorithms for weighted LCS problem
- Efficient dynamic dictionary matching with DAWGs and AC-automata
- Constructing words with high distinct square densities
- Indexing Circular Patterns
- Bijective linear time coding and decoding for \(k\)-trees
- Unweighted and weighted hyper-minimization
- Block trees
- General suffix automaton construction algorithm and space bounds
- Compressed string-matching in standard Sturmian words
- Density of distinct squares in non-primitive words
- Ideal presentations and numberings of some classes of effective quasi-Polish spaces
- On the Weihrauch degree of the additive Ramsey theorem
- On the first-order parts of problems in the Weihrauch degrees
- Efficient Computation of 2-Covers of a String.
- On the structure of compacted subword graphs of Thue-Morse words and their applications
- Multiple pattern matching: a Markov chain approach
- k-approximate quasiperiodicity under Hamming and edit distance
- Improved space-time tradeoffs for approximate full-text indexing with one edit error
- Ternary directed acyclic word graphs
- String Periods in the Order-Preserving Model
- On modification of Boyer-Moore-Horspool's algorithm for tree pattern matching in linearised trees
- On del-robust primitive words
- A space efficient direct access data structure
- The structure of subword graphs and suffix trees of Fibonacci words
- Tuning the Zhu-Takaoka string matching algorithm and experimental results.
- Automata for solid codes
- A new taxonomy of sublinear right-to-left scanning keyword pattern matching algorithms
- An efficient variable-to-fixed length encoding using multiplexed parse trees
- An extension of the Lyndon-Schützenberger result to pseudoperiodic words
- Palindromic decompositions with gaps and errors
- Relational codes of words
- scientific article; zbMATH DE number 828444 (Why is no real title available?)
- Boosting pattern matching performance via k-bit filtering
- Arbology: trees and pushdown automata
- Asymptotic behaviour of the maximal number of squares in standard Sturmian words
- A filtering technique for all pairs approximate parameterized string matching
- A fast algorithm for finding the positions of all squares in a run-length encoded string
- Finding the cyclic covers of a string
- Simple real-time constant-space string matching
- Time-optimal top-k document retrieval
- Extracting powers and periods in a word from its runs structure
- Simple real-time constant-space string matching
- Efficient counting of square substrings in a tree
- A linear time algorithm for consecutive permutation pattern matching
This page was built for publication: Jewels of Stringology
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4451072)
