| Longest common substrings with k mismatches T Flouri, E Giaquinta, K Kobert, E Ukkonen Information Processing Letters 115 (6-8), 643-647, 2015 | 48 | 2015 |
| A compact representation of nondeterministic (suffix) automata for the bit-parallel approach D Cantone, S Faro, E Giaquinta Annual Symposium on Combinatorial Pattern Matching, 288-298, 2010 | 31 | 2010 |
| New algorithms for binary jumbled pattern matching E Giaquinta, S Grabowski Information Processing Letters 113 (14-16), 538-542, 2013 | 29 | 2013 |
| String matching with inversions and translocations in linear average time (most of the time) S Grabowski, S Faro, E Giaquinta Information Processing Letters 111 (11), 516-520, 2011 | 28 | 2011 |
| A compact representation of nondeterministic (suffix) automata for the bit-parallel approach D Cantone, S Faro, E Giaquinta Information and Computation 213, 3-12, 2012 | 27 | 2012 |
| RegionSeeker: Automatically identifying and selecting accelerators from application source code G Zacharopoulos, L Ferretti, E Giaquinta, G Ansaloni, L Pozzi IEEE Transactions on Computer-Aided Design of Integrated Circuits and …, 2018 | 25 | 2018 |
| Approximate String Matching Allowing for Inversions and Translocations. D Cantone, S Faro, E Giaquinta Stringology, 37-51, 2010 | 22 | 2010 |
| Indexes for jumbled pattern matching in strings, trees and graphs F Cicalese, T Gagie, E Giaquinta, ES Laber, Z Lipták, R Rizzi, AI Tomescu String Processing and Information Retrieval: 20th International Symposium …, 2013 | 20 | 2013 |
| Filtration algorithms for approximate order-preserving matching T Chhabra, E Giaquinta, J Tarhio String Processing and Information Retrieval: 22nd International Symposium …, 2015 | 16 | 2015 |
| Technology beats algorithms (in exact string matching) J Tarhio, J Holub, E Giaquinta Software: Practice and Experience 47 (12), 1877-1885, 2017 | 15 | 2017 |
| Bit-(Parallelism)2: Getting to the Next Level of Parallelism D Cantone, S Faro, E Giaquinta Fun with Algorithms: 5th International Conference, FUN 2010, Ischia, Italy …, 2010 | 15 | 2010 |
| Maximum convex subgraphs under I/O constraint for automatic identification of custom instructions E Giaquinta, A Mishra, L Pozzi IEEE Transactions on Computer-Aided Design of Integrated Circuits and …, 2015 | 12 | 2015 |
| Approximate pattern matching with k-mismatches in packed text E Giaquinta, S Grabowski, K Fredriksson Information Processing Letters 113 (19), 693-697, 2013 | 12 | 2013 |
| Alternative algorithms for Lyndon factorization SS Ghuman, E Giaquinta, J Tarhio arXiv preprint arXiv:1405.4892, 2014 | 9 | 2014 |
| Fast matching of transcription factor motifs using generalized position weight matrix models E Giaquinta, S Grabowski, E Ukkonen Journal of Computational Biology 20 (9), 621-630, 2013 | 9 | 2013 |
| On the bit-parallel simulation of the nondeterministic Aho–Corasick and suffix automata for a set of patterns D Cantone, S Faro, E Giaquinta Journal of Discrete Algorithms 11, 25-36, 2012 | 9 | 2012 |
| Text searching allowing for inversions and translocations of factors D Cantone, S Faro, E Giaquinta Discrete Applied Mathematics 163, 247-257, 2014 | 8 | 2014 |
| Adapting boyer-moore-like algorithms for searching huffman encoded texts D Cantone, S Faro, E Giaquinta International Journal of Foundations of Computer Science 23 (02), 343-356, 2012 | 8 | 2012 |
| Motif matching using gapped patterns E Giaquinta, K Fredriksson, S Grabowski, AI Tomescu, E Ukkonen Theoretical Computer Science 548, 1-13, 2014 | 7 | 2014 |
| An effective exact algorithm and a new upper bound for the number of contacts in the hydrophobic-polar two-dimensional lattice model E Giaquinta, L Pozzi Journal of Computational Biology 20 (8), 593-609, 2013 | 6* | 2013 |
