Jewels of Stringology
From MaRDI portal
Publication:4451072
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)- Forbidden traces and forbidden subtraces
- Asynchronous trace-matching automata
- Equations on partial words
- Fast algorithm for partial covers in words
- Linear-time construction of two-dimensional suffix trees
- Computing the number of cubic runs in standard Sturmian words
- Algorithms on Strings
- Simple tree pattern matching for trees in the prefix bar notation
- Order-preserving matching
- A fast algorithm for finding the positions of all squares in a run-length encoded string
- Languages with mismatches
- Efficient seed computation revisited
- The greedy approach to dictionary-based static text compression on a distributed system
- Indexing factors with gaps
- Multiple pattern matching: a Markov chain approach
- On del-robust primitive words
- An Extension of the Lyndon Schützenberger Result to Pseudoperiodic Words
- An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence
- On the structure of compacted subword graphs of Thue-Morse words and their applications
- Distance measures for biological sequences: some recent approaches
- Unbordered pictures: properties and construction
- On the maximum number of cubic subwords in a word
- On regular tree languages and deterministic pushdown automata
- FRIEZES, STRINGS AND CLUSTER VARIABLES
- Efficient seeds computation revisited
- Tree template matching in ranked ordered trees by pushdown automata
- Non-expandable non-overlapping sets of pictures
- Compressed string-matching in standard Sturmian words
- A new taxonomy of sublinear right-to-left scanning keyword pattern matching algorithms
- The number of runs in a string
- Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails
- Distinct squares in run-length encoded strings
- Tree template matching in ranked ordered trees by pushdown automata
- scientific article; zbMATH DE number 828444 (Why is no real title available?)
- Computing the longest previous factor
- Minimal forbidden subwords
- The structure of subword graphs and suffix trees of Fibonacci words
- Universal reconstruction of a string
- Extracting powers and periods in a word from its runs structure
- Locally compressed suffix arrays
- New simple efficient algorithms computing powers and runs in strings
- Spaces, trees, and colors: the algorithmic landscape of document retrieval on sequences
- On-line construction of compact directed acyclic word graphs
- Universal reconstruction of a string
- Watson-Crick Conjugate and Commutative Words
- Simple real-time constant-space string matching
- Unbordered partial words
- A linear time algorithm for consecutive permutation pattern matching
- Sequence binary decision diagram: minimization, relationship to acyclic automata, and complexities of Boolean set operations
- An extension of the Lyndon-Schützenberger result to pseudoperiodic words
- \(V\)-order: new combinatorial properties \& a simple comparison algorithm
- Constructing words with high distinct square densities
- Efficient and secure generalized pattern matching via Fast Fourier Transform
- Improved space-time tradeoffs for approximate full-text indexing with one edit error
- Relational codes of words
- Functional programs as compressed data
- Efficient algorithms for shortest partial seeds in words
- Sturmian and Episturmian Words
- BLIM: A new bit-parallel pattern matching algorithm overcoming computer word size limitation
- Compatibility relations on codes and free monoids
- Disjunctivity and other properties of sets of pseudo-bordered words
- Usefulness of directed acyclic subword graphs in problems related to standard Sturmian words
- Fast algorithms for abelian periods in words and greatest common divisor queries
- Simple real-time constant-space string matching
- Implementation of directed acyclic word graph.
- A filtering technique for all pairs approximate parameterized string matching
- Time-optimal top-\(k\) document retrieval
- Freeness of partial words
- Asymptotic behaviour of the maximal number of squares in standard Sturmian words
- Polynomial-time approximation algorithms for weighted LCS problem
- A simple yet time-optimal and linear-space algorithm for shortest unique substring queries
- Optimal prefix and suffix queries on texts
- Repetitions in strings: algorithms and combinatorics
- Scalability and communication in parallel low-complexity lossless compression
- Sets of pictures avoiding overlaps
- Sparse and truncated suffix trees on variable-length codes
- Internal pattern matching queries in a text and applications
- Longest unbordered factor in quasilinear time
- Automata for solid codes
- Gray codes for Fibonacci \(q\)-decreasing words
- Efficient Computation of 2-Covers of a String.
- Boosting pattern matching performance via \(k\)-bit filtering
- Efficient dynamic dictionary matching with DAWGs and AC-automata
- Finding the cyclic covers of a string
- A space efficient direct access data structure
- Tuning the Zhu-Takaoka string matching algorithm and experimental results.
- Combinatorics on partial word correlations
- \(k\)-approximate quasiperiodicity under Hamming and edit distance
- Efficient counting of square substrings in a tree
- Solving string problems on graphs using the labeled direct product
- Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails
- Algorithmic techniques for the polymer sciences
- Computing the Antiperiod(s) of a String
- An efficient variable-to-fixed length encoding using multiplexed parse trees
- Tight bound for the number of distinct palindromes in a tree
- On trace inclusion optimization problems
- scientific article; zbMATH DE number 7651171 (Why is no real title available?)
- On new algorithms of mutual transformation of string schemes
- Longest repeats with a block of \(k\) don't cares
- String Periods in the Order-Preserving Model
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)
