Zobrazeno 1 - 10
of 25
pro vyhledávání: '"Emanuele Giaquinta"'
Publikováno v:
Algorithms, Vol 12, Iss 6, p 124 (2019)
We present two modifications of Duval’s algorithm for computing the Lyndon factorization of a string. One of the algorithms has been designed for strings containing runs of the smallest character. It works best for small alphabets and it is able to
Externí odkaz:
https://doaj.org/article/e643163e88504a10853f9f7f5298406c
Publikováno v:
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 38:741-754
Embedded systems present stringent and often conflicting requirements. On the one side, the need for high performance within a tight energy budget favors inflexible Application Specific Integrated Circuit (ASIC) implementations; on the other side, a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::68b632b63b5027d09fcd01a12eea3b1b
https://doi.org/10.1109/tcad.2018.2818689
https://doi.org/10.1109/tcad.2018.2818689
Publikováno v:
Software: Practice and Experience. 47:1877-1885
Summary More than 120 algorithms have been developed for exact string matching within the last 40 years. We show by experiments that the naive algorithm exploiting SIMD instructions of modern CPUs (with symbols compared in a special order) is the fas
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::687fb2b72fe8909ae5f8b4d9e2f7d5c1
https://doi.org/10.1002/spe.2511
https://doi.org/10.1002/spe.2511
Publikováno v:
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 34:483-494
Automatic identification of custom instructions (CI) is the process of supporting the programmer in choosing automatically beneficial parts of the application source code that can then be synthesized and run on dedicated hardware. Identification is t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ffd137a7e63dcb4503fa85497f4fa7b2
https://doi.org/10.1109/tcad.2014.2387375
https://doi.org/10.1109/tcad.2014.2387375
Publikováno v:
Theoretical Computer Science. 548:1-13
We present new algorithms for the problem of multiple string matching of gapped patterns, where a gapped pattern is a sequence of strings such that there is a gap of fixed length between each two consecutive strings. The problem has applications in t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2f9a8df886f19b3c46a63320b01b069f
https://doi.org/10.1016/j.tcs.2014.06.032
https://doi.org/10.1016/j.tcs.2014.06.032
Publikováno v:
Algorithms, Vol 12, Iss 6, p 124 (2019)
Algorithms
Volume 12
Issue 6
Algorithms
Volume 12
Issue 6
We present two modifications of Duval&rsquo
s algorithm for computing the Lyndon factorization of a string. One of the algorithms has been designed for strings containing runs of the smallest character. It works best for small alphabets and it i
s algorithm for computing the Lyndon factorization of a string. One of the algorithms has been designed for strings containing runs of the smallest character. It works best for small alphabets and it i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::708e6a763b748b2f5d6539a2c7249578
https://doi.org/10.3390/a12060124
https://doi.org/10.3390/a12060124
Publikováno v:
Information Processing Letters. 113:693-697
Given strings $P$ of length $m$ and $T$ of length $n$ over an alphabet of size $\sigma$, the string matching with $k$-mismatches problem is to find the positions of all the substrings in $T$ that are at Hamming distance at most $k$ from $P$. If $T$ c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d4565d59414bde6741792e13e8e85c2e
https://doi.org/10.1016/j.ipl.2013.07.002
https://doi.org/10.1016/j.ipl.2013.07.002
Autor:
Szymon Grabowski, Emanuele Giaquinta
Publikováno v:
Information Processing Letters. 113:538-542
Given a pattern P and a text T, both strings over a binary alphabet, the binary jumbled string matching problem consists in telling whether any permutation of P occurs in T. The indexed version of this problem, i.e., preprocessing a string to efficie
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5cda580a9cb4142fdf55177d8a50f352
https://doi.org/10.1016/j.ipl.2013.04.013
https://doi.org/10.1016/j.ipl.2013.04.013
Publikováno v:
Journal of Discrete Algorithms. 11:25-36
In this paper we present a method to simulate, using the bit-parallelism technique, the nondeterministic Aho-Corasick automaton and the nondeterministic suffix automaton induced by the trie and by the Directed Acyclic Word Graph for a set of patterns
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8554ce08f0e53ac7e3d61e64259291cf
Publikováno v:
International Journal of Foundations of Computer Science. 23:323-342
The Pattern Matching problem with Swaps consists in finding all occurrences of a pattern P in a text T, when disjoint local swaps in the pattern are allowed. In the Approximate Pattern Matching problem with Swaps one seeks, for every text location wi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::830e3a278807dbac47836f892b7122de
https://doi.org/10.1142/s0129054112400151
https://doi.org/10.1142/s0129054112400151