Emanuele Giaquinta

Orcid: 0000-0002-9473-3971

According to our database1, Emanuele Giaquinta authored at least 26 papers between 2008 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2019
RegionSeeker: Automatically Identifying and Selecting Accelerators From Application Source Code.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2019

Lyndon Factorization Algorithms for Small Alphabets and Run-Length Encoded Strings.
Algorithms, 2019

2017
Technology beats algorithms (in exact string matching).
Softw. Pract. Exp., 2017

2015
Maximum Convex Subgraphs Under I/O Constraint for Automatic Identification of Custom Instructions.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2015

Longest common substrings with k mismatches.
Inf. Process. Lett., 2015

Run-Length Encoded Nondeterministic KMP and Suffix Automata.
Proceedings of the Implementation and Application of Automata, 2015

Filtration Algorithms for Approximate Order-Preserving Matching.
Proceedings of the String Processing and Information Retrieval, 2015

2014
Motif matching using gapped patterns.
Theor. Comput. Sci., 2014

On a compact encoding of the swap automaton.
Inf. Process. Lett., 2014

Text searching allowing for inversions and translocations of factors.
Discret. Appl. Math., 2014

Alternative Algorithms for Lyndon Factorization.
Proceedings of the Prague Stringology Conference 2014, Prague, Czech Republic, 2014

2013
An Effective Exact Algorithm and a New Upper Bound for the Number of Contacts in the Hydrophobic-Polar Two-Dimensional Lattice Model.
J. Comput. Biol., 2013

Fast Matching of Transcription Factor Motifs Using Generalized Position Weight Matrix Models.
J. Comput. Biol., 2013

Approximate pattern matching with k-mismatches in packed text.
Inf. Process. Lett., 2013

New algorithms for binary jumbled pattern matching.
Inf. Process. Lett., 2013

Indexes for Jumbled Pattern Matching in Strings, Trees and Graphs.
Proceedings of the String Processing and Information Retrieval, 2013

Motif Matching Using Gapped Patterns.
Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

2012
On the bit-parallel simulation of the nondeterministic Aho-Corasick and suffix automata for a set of patterns.
J. Discrete Algorithms, 2012

Adapting Boyer-Moore-like Algorithms for Searching Huffman Encoded Texts.
Int. J. Found. Comput. Sci., 2012

Pattern Matching with Swaps in Practice.
Int. J. Found. Comput. Sci., 2012

A compact representation of nondeterministic (suffix) automata for the bit-parallel approach.
Inf. Comput., 2012

2011
String matching with inversions and translocations in linear average time (most of the time).
Inf. Process. Lett., 2011

2010
Approximate String Matching Allowing for Inversions and Translocations.
Proceedings of the Prague Stringology Conference 2010, Prague, Czech Republic, August 30, 2010

Bit-(Parallelism)<sup>2</sup>: Getting to the Next Level of Parallelism.
Proceedings of the Fun with Algorithms, 5th International Conference, 2010

2009
An Efficient Algorithm for Approximate Pattern Matching with Swaps.
Proceedings of the Prague Stringology Conference 2009, Prague, Czech Republic, August 31, 2009

2008
Finite State Models for the Generation of Large Corpora of Natural Language Texts.
Proceedings of the Finite-State Methods and Natural Language Processing, 2008


  Loading...