Emanuele Giaquinta

activity

20102016

most citedLongest common substrings with k mismatches

36 citations · 94 across the 10 of their papers we have counts for

collaborators

Showing 2014Show all

3 papers · 1 filter

cs.FL2014

Run-Length Encoded Nondeterministic KMP and Suffix Automata

Emanuele Giaquinta

We present a novel bit-parallel representation, based on the run-length encoding, of the nondeterministic KMP and suffix automata for a string $P$ with at least two distinct symbol…

cs.DS2014★ 36 cited

Longest common substrings with k mismatches

Tomas Flouri, Emanuele Giaquinta, Kassian Kobert +1

The longest common substring with $k$ -mismatches problem is to find, given two strings $S_{1}$ and $S_{2}$ , a longest substring $A_{1}$ of $S_{1}$ and $A_{2}$ of $S_{2}$ such that the Hamming…

cs.DS2014★ 1 cited

Alternative Algorithms for Lyndon Factorization

Sukhpal Singh Ghuman, Emanuele Giaquinta, Jorma Tarhio

We present two variations of Duval's algorithm for computing the Lyndon factorization of a word. The first algorithm is designed for the case of small alphabets and is able to skip…