The following pages link to (Q4125823):
Displaying 45 items.
- Efficient special cases of pattern matching with swaps (Q293429) (← links)
- Permuted scaled matching (Q294926) (← links)
- Indexing and querying color sets of images (Q306719) (← links)
- Various improvements to text fingerprinting (Q396662) (← links)
- An efficient algorithm for sequence comparison with block reversals (Q596144) (← links)
- Efficient constructions of test sets for regular and context-free languages (Q685373) (← links)
- LCS approximation via embedding into locally non-repetitive strings (Q716327) (← links)
- Masking patterns in sequences: A new class of motif discovery with don't cares (Q732023) (← links)
- Parallel construction of minimal suffix and factor automata (Q911778) (← links)
- Parallel tree pattern matching (Q912610) (← links)
- Approximate string matching with address bit errors (Q1038472) (← links)
- Parallel construction of a suffix tree with applications (Q1104104) (← links)
- Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays (Q1177175) (← links)
- On finding common subtrees (Q1208722) (← links)
- Alphabet-independent optimal parallel search for three-dimensional patterns (Q1275083) (← links)
- Parallel construction and query of index data structures for pattern matching on square matrices (Q1288531) (← links)
- On two-dimensional pattern matching by optimal parallel algorithms (Q1334677) (← links)
- Pattern matching in a digitized image (Q1336966) (← links)
- Multiple sequence comparison -- a peptide matching approach (Q1390863) (← links)
- Validating the Knuth-Morris-Pratt failure function, fast and online (Q1678758) (← links)
- Period recovery of strings over the Hamming and edit distances (Q1698696) (← links)
- Motif trie: an efficient text index for pattern discovery with don't cares (Q1698709) (← links)
- Finding maximal 2-dimensional palindromes (Q1740657) (← links)
- Comparison of strings belonging to the same family (Q1818790) (← links)
- Efficient text fingerprinting via Parikh mapping (Q1827267) (← links)
- Finding all periods and initial palindromes of a string in parallel (Q1899224) (← links)
- Multidimensional period recovery (Q2144266) (← links)
- 2-dimensional palindromes with \(k\) mismatches (Q2203604) (← links)
- Two-dimensional maximal repetitions (Q2297850) (← links)
- Universal reconstruction of a string (Q2297860) (← links)
- Efficient one-dimensional real scaled matching (Q2457290) (← links)
- Linear time algorithm for the longest common repeat problem (Q2457296) (← links)
- Faster suffix sorting (Q2465058) (← links)
- Double string tandem repeats (Q2700385) (← links)
- Universal Reconstruction of a String (Q3449836) (← links)
- Faster Algorithm for the Set Variant of the String Barcoding Problem (Q3506944) (← links)
- Approximate String Matching with Address Bit Errors (Q3506947) (← links)
- LCS Approximation via Embedding into Local Non-repetitive Strings (Q3637107) (← links)
- Optimal parallel algorithms for Prefix Matching (Q4632427) (← links)
- On the construction of classes of suffix trees for square matrices: Algorithms and applications (Q4645171) (← links)
- Algorithms for list structure condensation (Q4772174) (← links)
- Forty Years of Text Indexing (Q4928554) (← links)
- (Q5009559) (← links)
- Repetition Detection in a Dynamic String (Q5075738) (← links)
- Optimal parallel suffix tree construction (Q5906825) (← links)
