The following pages link to (Q4849531):
Displaying 50 items.
- A fast algorithm for stereo matching (Q287131) (← links)
- Tight bounds on the complexity of the Apostolico-Giancarlo algorithm (Q287179) (← links)
- Periodicity in rectangular arrays (Q344541) (← links)
- Abelian-primitive partial words (Q388787) (← links)
- Simple real-time constant-space string matching (Q390869) (← links)
- On-line construction of position heaps (Q396632) (← links)
- A note on a simple computation of the maximal suffix of a string (Q396649) (← links)
- On the structure of compacted subword graphs of Thue-Morse words and their applications (Q414440) (← links)
- On the bit-parallel simulation of the nondeterministic Aho-Corasick and suffix automata for a set of patterns (Q414441) (← links)
- A compact representation of nondeterministic (suffix) automata for the bit-parallel approach (Q418159) (← links)
- Worst-case efficient single and multiple string matching on packed texts in the word-RAM model (Q450552) (← links)
- Text searching allowing for inversions and translocations of factors (Q496536) (← links)
- Generalized pattern matching and periodicity under substring consistent equivalence relations (Q507402) (← links)
- Efficient computation of maximal anti-exponent in palindrome-free strings (Q507406) (← links)
- Algorithms for finding a most similar subforest (Q538470) (← links)
- On word equations in one variable (Q547296) (← links)
- On the complexity of decidable cases of the commutation problem of languages (Q557812) (← links)
- Space efficient search for maximal repetitions (Q557913) (← links)
- String-matching with OBDDs (Q596086) (← links)
- Ternary directed acyclic word graphs (Q703500) (← links)
- Linear-time computation of local periods (Q703549) (← links)
- On suffix extensions in suffix trees (Q714837) (← links)
- On z-factorization and c-factorization of standard episturmian words (Q719264) (← links)
- On the size of Boyer-Moore automata (Q732040) (← links)
- Scaled and permuted string matching (Q834966) (← links)
- Accelerating Boyer-Moore searches on binary texts (Q840783) (← links)
- Faster subsequence recognition in compressed strings (Q843615) (← links)
- Efficient parameterized string matching (Q845838) (← links)
- Faster two-dimensional pattern matching with rotations (Q859847) (← links)
- Testing primitivity on partial words (Q868383) (← links)
- An automata-theoretic approach to the word problem for \(\omega\)-terms over R (Q868948) (← links)
- A unifying look at the Apostolico--Giancarlo string-matching algorithm (Q876692) (← links)
- Compact directed acyclic word graphs for a sliding window (Q876704) (← links)
- Equivalence of simple functions (Q880171) (← links)
- Fast profile matching algorithms - A survey (Q932308) (← links)
- Description and analysis of a bottom-up DFA minimization algorithm (Q963396) (← links)
- Some theoretical challenges in digital geometry: a perspective (Q967394) (← links)
- Improving the bit-parallel NFA of Baeza-Yates and Navarro for approximate string matching (Q975479) (← links)
- Parameterized matching on non-linear structures (Q989510) (← links)
- Improving practical exact string matching (Q990135) (← links)
- Semi-local longest common subsequences in subquadratic time (Q1002102) (← links)
- On special families of morphisms related to \(\delta \)-matching and don't care symbols (Q1007535) (← links)
- Disjunctive partial deduction of a right-to-left string-matching algorithm (Q1014430) (← links)
- Discovering subword associations in strings in time linear in the output size (Q1026231) (← links)
- Unbordered partial words (Q1028413) (← links)
- Searching for gapped palindromes (Q1038475) (← links)
- Average-optimal string matching (Q1044048) (← links)
- An improved algorithm for solving the banded cyclic string-to-string correction problem (Q1129017) (← links)
- How many squares can a string contain? (Q1268630) (← links)
- Alphabet-independent optimal parallel search for three-dimensional patterns (Q1275083) (← links)
