The following pages link to Szymon Grabowski (Q313773):
Displaying 18 items.
- New tabulation and sparse dynamic programming based techniques for sequence similarity problems (Q313774) (← links)
- Motif matching using gapped patterns (Q401471) (← links)
- Tight and simple web graph compression for forward and reverse neighbor queries (Q496546) (← links)
- A general compression algorithm that supports fast searching (Q845872) (← links)
- Range mode and range median queries in constant time and sub-quadratic space (Q976080) (← links)
- Average-optimal string matching (Q1044048) (← links)
- Exploiting word-level parallelism for fast convolutions and their applications in approximate string matching (Q1761497) (← links)
- Longest common abelian factors and large alphabets (Q1796849) (← links)
- String matching with inversions and translocations in linear average time (most of the time) (Q1944938) (← links)
- Space-efficient Huffman codes revisited (Q2094355) (← links)
- Efficient algorithms for the longest common subsequence in \(k\)-length substrings (Q2252645) (← links)
- A note on the longest common substring with \(k\)-mismatches problem (Q2345875) (← links)
- Bit-parallel string matching under Hamming distance in \(O(n\lceil m/w\rceil)\) worst case time (Q2380069) (← links)
- New algorithms for binary jumbled pattern matching (Q2444765) (← links)
- Approximate pattern matching with \(k\)-mismatches in packed text (Q2445229) (← links)
- Motif Matching Using Gapped Patterns (Q2870056) (← links)
- A SIMPLE ALPHABET-INDEPENDENT FM-INDEX (Q3421851) (← links)
- Suffix arrays with a twist (Q6487692) (← links)
