The following pages link to Kimmo Fredriksson (Q401470):
Displaying 37 items.
- Motif matching using gapped patterns (Q401471) (← links)
- Efficient parameterized string matching (Q845838) (← links)
- A general compression algorithm that supports fast searching (Q845872) (← links)
- Shift-or string matching with super-alphabets (Q1014420) (← links)
- Exploiting distance coherence to speed up range queries in metric indexes (Q1041769) (← links)
- Average-optimal string matching (Q1044048) (← links)
- On building minimal automaton for subset matching queries (Q1675873) (← links)
- Exploiting word-level parallelism for fast convolutions and their applications in approximate string matching (Q1761497) (← links)
- Average complexity of exact and approximate multiple string matching (Q1885904) (← links)
- Rotation and lighting invariant template matching (Q2373879) (← links)
- Bit-parallel string matching under Hamming distance in \(O(n\lceil m/w\rceil)\) worst case time (Q2380069) (← links)
- Approximate pattern matching with \(k\)-mismatches in packed text (Q2445229) (← links)
- On a compact encoding of the swap automaton (Q2446600) (← links)
- Sequential and indexed two-dimensional combinatorial template matching allowing rotations (Q2576875) (← links)
- Motif Matching Using Gapped Patterns (Q2870056) (← links)
- FLEXIBLE MUSIC RETRIEVAL IN SUBLINEAR TIME (Q3421849) (← links)
- Increased bit-parallelism for approximate and multiple string matching (Q3507750) (← links)
- EFFICIENT ALGORITHMS FOR (δ,γ,α) AND (δ, k<sub>Δ</sub>, α)-MATCHING (Q3532148) (← links)
- Average-Optimal Multiple Approximate String Matching (Q3550831) (← links)
- From Nondeterministic Suffix Automaton to Lazy Suffix Tree (Q3558263) (← links)
- Nested Counters in Bit-Parallel String Matching (Q3618593) (← links)
- Simple Random Access Compression (Q3635991) (← links)
- Fast Convolutions and Their Applications in Approximate String Matching (Q3651551) (← links)
- (Q4536411) (← links)
- (Q4654274) (← links)
- (Q4737703) (← links)
- Efficient Bit-Parallel Algorithms for (δ,α)-Matching (Q5307542) (← links)
- Combinatorial Pattern Matching (Q5315353) (← links)
- String Processing and Information Retrieval (Q5393960) (← links)
- Succinct backward-DAWG-matching (Q5406177) (← links)
- Simple Compression Code Supporting Random Access and Fast String Matching (Q5432317) (← links)
- Simple Space-Time Trade-Offs for AESA (Q5432318) (← links)
- Average-optimal single and multiple approximate string matching (Q5463450) (← links)
- (Q5487107) (← links)
- String Processing and Information Retrieval (Q5897132) (← links)
- String Processing and Information Retrieval (Q5897135) (← links)
- LATIN 2004: Theoretical Informatics (Q5901624) (← links)