scientific article; zbMATH DE number 801745
From MaRDI portal
Publication:4849531
complexity measurescompression techniquespattern matching algorithmsstring matching algorithmstext algorithmic techniques
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Theory of compilers and interpreters (68N20) Combinatorics on words (68R15) Computing methodologies for text processing; mathematical typography (68U15) Distributed algorithms (68W15) Symbolic computation and algebraic computation (68W30)
Recommendations
Cited in
(only showing first 100 items - show all)- Semi-local longest common subsequences in subquadratic time
- On special families of morphisms related to \(\delta \)-matching and don't care symbols
- Disjunctive partial deduction of a right-to-left string-matching algorithm
- Discovering subword associations in strings in time linear in the output size
- Unbordered partial words
- Searching for gapped palindromes
- Average-optimal string matching
- An improved algorithm for solving the banded cyclic string-to-string correction problem
- How many squares can a string contain?
- Alphabet-independent optimal parallel search for three-dimensional patterns
- Optimal representation in average using Kolmogorov complexity
- Parallel construction and query of index data structures for pattern matching on square matrices
- The exact number of squares in Fibonacci words
- Constant-space string-matching in sublinear average time
- Asymptotic estimation of the average number of terminal states in DAWGs
- Cut and paste
- A time and space efficient data structure for string searching on large texts
- Periodicity, morphisms, and matrices.
- Conjugacy and episturmian morphisms.
- Application of Lempel-Ziv factorization to the approximation of grammar-based compression.
- Generalizations of suffix arrays to multi-dimensional matrices.
- Truncated suffix trees and their application to data compression.
- Overlap matching.
- Combinatorics of periods in strings.
- Algorithmic complexity of protein identification: Combinatorics of weighted strings
- An average-case optimal one-variable pattern language learner
- Approximate string matching using factor automata
- Normal forms of quasiperiodic strings
- Optimal pattern matching algorithms
- A faster quick search algorithm
- siEDM: an efficient string index and search algorithm for edit distance with moves
- Verifiable pattern matching on outsourced texts
- On-line construction of compact directed acyclic word graphs
- Linear time algorithms for finding and representing all the tandem repeats in a string
- The wide window string matching algorithm
- Partial words and the critical factorization theorem
- Inverse Lyndon words and inverse Lyndon factorizations of words
- Extreme witnesses and their applications
- Approximate string matching on Ziv--Lempel compressed text
- Tree pattern matching with a more general notion of occurrence of the pattern.
- A speed-up for the commute between subword trees and DAWGs.
- Compact recognizers of episode sequences
- Regular biosequence pattern matching with cellular automata
- Discovering instances of poetic allusion from anthologies of classical Japanese poems
- Discovering characteristic expressions in literary works.
- On the complexity of pattern matching for highly compressed two-dimensional texts.
- Collage system: A unifying framework for compressed pattern matching.
- Approximate pattern matching and transitive closure logics.
- A new regular grammar pattern matching algorithm.
- On maximal suffixes and constant-space linear-time versions of KMP algorithm.
- Two-dimensional pattern matching with rotations
- Average complexity of exact and approximate multiple string matching
- Complexity-compression tradeoffs in lossy compression via efficient random codebooks and databases
- Periods and binary words
- Efficient string matching based on a two-step simulation of the suffix automaton
- Closed Ziv-Lempel factorization of the \(m\)-bonacci words
- The Range Automaton: an efficient approach to text-searching
- Automata for solid codes
- Fully-online suffix tree and directed acyclic word graph construction for multiple texts
- Efficient dynamic dictionary matching with DAWGs and AC-automata
- Compressed automata for dictionary matching
- Fast distance multiplication of unit-Monge matrices
- Space-efficient representation of truncated suffix trees, with applications to Markov order estimation
- Swap and mismatch edit distance
- Algorithms for subsequence combinatorics
- Full sets of pictures to encode pictures
- Towards optimal packed string matching
- Languages with mismatches
- Partial words and the critical factorization theorem revisited
- Generalized function matching
- Primitive partial words
- Detecting regularities on grammar-compressed strings
- Bit-parallel (\(\delta ,\gamma\))-matching and suffix automata
- Practical algorithms for transposition-invariant string-matching
- A weak approach to suffix automata simulation for exact and approximate string matching
- Compact suffix automata representations for searching long patterns
- NR-grep: A fast and flexible pattern-matching tool
- Verifiable pattern matching on outsourced texts
- Efficient ranking of Lyndon words and decoding lexicographically minimal de Bruijn sequence
- Synchronized regular expressions
- A fast algorithm for stereo matching
- Tight bounds on the complexity of the Apostolico-Giancarlo algorithm
- An aperiodicity problem for multiwords
- A fast suffix automata based algorithm for exact online string matching
- Random deterministic automata
- Run-Length Encoded Nondeterministic KMP and Suffix Automata
- A faster algorithm for computing maximal -gapped repeats in a string
- Worst case efficient single and multiple string matching in the RAM model
- Simple real-time constant-space string matching
- The factor automaton.
- scientific article; zbMATH DE number 2131247 (Why is no real title available?)
- Algorithms for indexing highly similar DNA sequences
- Periodicity in rectangular arrays
- Extreme witnesses and their applications
- Accelerating Boyer Moore Searches on Binary Texts
- Searching for Gapped Palindromes
- Equations on partial words
- Recovering Repetitive Sub-functions from Observations
- Abelian-primitive partial words
- Simple real-time constant-space string matching
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4849531)
