The following pages link to Emanuele Giaquinta (Q401469):
Displayed 15 items.
- Motif matching using gapped patterns (Q401471) (← 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)
- Text searching allowing for inversions and translocations of factors (Q496536) (← links)
- String matching with inversions and translocations in linear average time (most of the time) (Q1944938) (← links)
- Lyndon factorization algorithms for small alphabets and run-length encoded strings (Q2004905) (← links)
- Longest common substrings with \(k\) mismatches (Q2345877) (← links)
- New algorithms for binary jumbled pattern matching (Q2444765) (← links)
- Approximate pattern matching with \(k\)-mismatches in packed text (Q2445229) (← links)
- On a compact encoding of the swap automaton (Q2446600) (← links)
- Motif Matching Using Gapped Patterns (Q2870056) (← links)
- PATTERN MATCHING WITH SWAPS IN PRACTICE (Q2909198) (← links)
- ADAPTING BOYER-MOORE-LIKE ALGORITHMS FOR SEARCHING HUFFMAN ENCODED TEXTS (Q2909199) (← links)
- Run-Length Encoded Nondeterministic KMP and Suffix Automata (Q2947413) (← links)
- A Compact Representation of Nondeterministic (Suffix) Automata for the Bit-Parallel Approach (Q3575255) (← links)