The following pages link to (Q4385510):
Displayed 33 items.
- How the character comparison order shapes the shift function of on-line pattern matching algorithms (Q671355) (← links)
- An algorithm for matching run-length coded strings (Q685867) (← links)
- Bounded similarity querying for time-series data (Q703853) (← links)
- On the size of Boyer-Moore automata (Q732040) (← links)
- A complete mechanization of correctness of a string-preprocessing algorithm (Q816208) (← links)
- A coarse-grained multicomputer algorithm for the detection of repetitions (Q835058) (← links)
- A fast algorithm for finding the positions of all squares in a run-length encoded string (Q837185) (← links)
- Incremental discovery of the irredundant motif bases for all suffixes of a string in \(O(n^2\log n)\)time (Q959798) (← links)
- On the closure of pattern expressions languages under intersection with regular languages (Q1015391) (← links)
- On the intersection of regex languages with regular languages (Q1019712) (← links)
- String-matching on ordered alphabets (Q1190451) (← links)
- A variation on the Boyer-Moore algorithm (Q1190458) (← links)
- Efficient CRCW-PRAM algorithms for universal substring searching (Q1208721) (← links)
- Cut and paste (Q1307691) (← links)
- Dynamic dictionary matching with failure functions (Q1331942) (← links)
- Speeding up two string-matching algorithms (Q1336956) (← links)
- On Boyer-Moore automata (Q1336957) (← links)
- Classes of cost functions for string edit distance (Q1355732) (← links)
- Saving comparisons in the Crochemore-Perrin string-matching algorithm (Q1365685) (← links)
- Matching a set of strings with variable length don't cares (Q1391531) (← links)
- A characterization of the squares in a Fibonacci string (Q1392029) (← links)
- Fast pattern matching in indexed texts (Q1566727) (← links)
- An efficient null-free procedure for deciding regular language membership (Q1575893) (← links)
- A new regular grammar pattern matching algorithm. (Q1874408) (← links)
- Squares, cubes, and time-space efficient string searching (Q1894296) (← links)
- Fast approximate matching of words against a dictionary (Q1895867) (← links)
- One-unambiguity of regular expressions with numeric occurrence indicators (Q2373702) (← links)
- Prefix-free regular languages and pattern matching (Q2465647) (← links)
- On-line string matching algorithms: survey and experimental results (Q2720122) (← links)
- On Extended Regular Expressions (Q3618588) (← links)
- Proof of Correctness of a Direct Construction of DFA from Regular Expression (Q4384033) (← links)
- VIRTUAL OPERATIONS ON VIRTUAL NETWORKS: THE PRIORITY UNION (Q5696953) (← links)
- Window-accumulated subsequence matching problem is linear (Q5957906) (← links)