Fast Pattern Matching in Strings
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Faster pattern matching with character classes using prime number encoding
- Burrows-Wheeler transform and Sturmian words
- Waiting time and complexity for matching patterns with automata
- Shift-or string matching with super-alphabets
- Disjunctive partial deduction of a right-to-left string-matching algorithm
- Fast parameterized matching with \(q\)-grams
- Real two dimensional scaled matching
- The factors analysis and algorithm implementation of single-pattern matching
- Searching for gapped palindromes
- Detecting palindromes, patterns and borders in regular languages
- Everywhere -repetitive sequences and Sturmian words
- On the Ehrenfeucht-Mycielski sequence
- Average-optimal string matching
- Two-dimensional pattern matching by two-dimensional on-line tessellation acceptors
- A linear time solution to the single function coarsest partition problem
- The smallest automaton recognizing the subwords of a text
- New algorithms for the LCS problem
- Optimal algorithms for finding the symmetries of a planar point set
- Structural properties of the string statistics problem
- Efficient string matching with k mismatches
- On two-dimensional pattern-matching languages and their decision problems
- Le calcul rapide des mélanges de deux mots. (Fast computing of the shuffle of two words)
- A greedy approximation algorithm for constructing shortest common superstrings
- On the connectivity of the De Bruijn graph
- Complexity, combinatorial group theory and the language of palutators
- Remarks on string-matching and one-way multihead automata
- Fast string matching with k differences
- Parallel processing of encoded bit strings
- Matching patterns in strings subject to multi-linear transformations
- La reconnaissance des facteurs d'un langage fini dans un texte en temps linéaire. (Recognition of the factors of a finite language in a text in linear time)
- On the subtree isomorphism problem for ordered trees
- On some properties of very pure codes
- A string searching algorithm
- Lexicographically least circular substrings
- Linear-time string-matching using only a fixed number of local storage locations
- Fast string searching by finding subkeys in subtext
- Finding patterns common to a set of strings
- String overlaps, pattern matching, and nontransitive games
- Periods in strings
- An optimal algorithm for computing the repetitions in a word
- A combinatorial property of the Fibonacci words
- Relationship between the period of a finite word and the length of its unbordered segments
- On some combinatorial problems in free monoids
- Steady-paced-output and fractional-on-line algorithms on a RAM
- Optimal off-line detection of repetitions in a string
- Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays
- Optimal canonization of all substrings of a string
- Correctness and efficiency of pattern matching algorithms
- Average running time of the Boyer-Moore-Horspool algorithm
- String-matching on ordered alphabets
- Two recognizable string-matching problems over free partially commutative monoids
- Optimal algorithms for computing the canonical form of a circular string
- A variation on the Boyer-Moore algorithm
- A string-matching interpretation of the equation x^ m y^ n = z^ p
- Fast average-case pattern matching by multiplexing sparse tables
- An efficient algorithm for the all pairs suffix-prefix problem
- A practical method for implementing string pattern matching machines
- Partial memoization for obtaining linear time behavior of a 2DPDA
- Fast detection and display of symmetry in outerplanar graphs
- Finding all the palindromes in a binary tree in linear time and space
- String matching problems over free partially commutative monoids
- Efficient CRCW-PRAM algorithms for universal substring searching
- Identifying periodic occurrences of a template with applications to protein structure
- Two-dimensional dictionary matching
- An on-line string superprimitivity test
- Deciding whether a finite set of words has rank at most two
- An application of pattern matching to a problem in geometrical complexity
- An O(N) algorithm for finding periodicity of a sequence using hash coding
- An improved algorithm to check for polygon similarity
- Palindrome recognition in real time by a multitape Turing machine
- A fast equivalence-checking algorithm for circular lists
- Periodes et repetitions des mots du monoide libre
- On polygon similarity
- Optimal parallel two dimensional text searching on a CREW PRAM
- Intertwinings of periodic sequences
- Transforming curves on surfaces
- Constant-space string-matching in sublinear average time
- Quasiperiodicity and string covering
- The derivation of on-line algorithms, with an application to finding palindromes
- Three one-way heads cannot do string matching
- Alphabet dependence in parameterized matching
- An optimal algorithm to compute all the covers of a string
- Dynamic dictionary matching with failure functions
- Bounded degree graph inference from walks
- Faster implementation of a shortest superstring approximation
- Speeding up two string-matching algorithms
- On Boyer-Moore automata
- Sublinear approximate string matching and biological applications
- A sublinear algorithm for approximate keyword searching
- Dynamic dictionary matching
- Refined simulation of multihead automata
- Some combinatorial properties of Sturmian words
- A polynomial algorithm for deciding bisimilarity of normed context-free processes
- On the language of primitive words
- Efficient matching of nonrectangular shapes.
- Saving comparisons in the Crochemore-Perrin string-matching algorithm
- Fibonacci numbers and words
- The zooming method: A recursive approach to time-space efficient string-matching
- A characterization of the squares in a Fibonacci string
- Undecidable properties of monoids with word problem solvable in linear time.
This page was built for publication: Fast Pattern Matching in Strings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4148937)
