 | 2012 |
|---|
| 36 |       | Simone Faro,
Thierry Lecroq:
A Multiple Sliding Windows Approach to Speed Up String Matching Algorithms.
SEA 2012: 172-183 |
| 35 | | Domenico Cantone,
Simone Faro,
Emanuele Giaquinta:
A compact representation of nondeterministic (suffix) automata for the bit-parallel approach.
Inf. Comput. 213: 3-12 (2012) |
| 34 | | Matteo Campanelli,
Domenico Cantone,
Simone Faro,
Emanuele Giaquinta:
Pattern Matching with Swaps in Practice.
Int. J. Found. Comput. Sci. 23(2): 323-342 (2012) |
| 33 | | Domenico Cantone,
Simone Faro,
Emanuele Giaquinta:
Adapting Boyer-Moore-like Algorithms for Searching Huffman Encoded Texts.
Int. J. Found. Comput. Sci. 23(2): 343-356 (2012) |
| 32 | | Domenico Cantone,
Simone Faro,
Emanuele Giaquinta:
On the bit-parallel simulation of the nondeterministic Aho-Corasick and suffix automata for a set of patterns.
J. Discrete Algorithms 11: 25-36 (2012) |
| 2011 |
|---|
| 31 | | Domenico Cantone,
Salvatore Cristofaro,
Simone Faro:
Efficient Matching of Biological Sequences Allowing for Non-overlapping Inversions.
CPM 2011: 364-375 |
| 30 | | Szymon Grabowski,
Simone Faro,
Emanuele Giaquinta:
String matching with inversions and translocations in linear average time (most of the time).
Inf. Process. Lett. 111(11): 516-520 (2011) |
| 2010 |
|---|
| 29 | | Domenico Cantone,
Simone Faro,
Emanuele Giaquinta:
A Compact Representation of Nondeterministic (Suffix) Automata for the Bit-Parallel Approach.
CPM 2010: 288-298 |
| 28 | | Domenico Cantone,
Simone Faro,
Emanuele Giaquinta:
Bit-(Parallelism)2: Getting to the Next Level of Parallelism.
FUN 2010: 166-177 |
| 27 | | Simone Faro,
Elisa Pappalardo:
Ant-CSP: An Ant Colony Optimization Algorithm for the Closest String Problem.
SOFSEM 2010: 370-381 |
| 26 | | Szymon Grabowski,
Simone Faro,
Emanuele Giaquinta:
String Matching with Inversions and Translocations in Linear Average Time (Most of the Time)
CoRR abs/1012.0280: (2010) |
| 25 | | Domenico Cantone,
Simone Faro:
On Tuning the Bad-Character Rule: the Worst-Character Rule
CoRR abs/1012.1338: (2010) |
| 24 | | Simone Faro,
Thierry Lecroq:
The Exact String Matching Problem: a Comprehensive Experimental Evaluation
CoRR abs/1012.2547: (2010) |
| 2009 |
|---|
| 23 | | Simone Faro,
Thierry Lecroq:
An Efficient Matching Algorithm for Encoded DNA Sequences and Binary Strings.
CPM 2009: 106-115 |
| 22 | | Matteo Campanelli,
Domenico Cantone,
Simone Faro:
A New Algorithm for Efficient Pattern Matching with Swaps.
IWOCA 2009: 230-241 |
| 21 | | Domenico Cantone,
Simone Faro:
Pattern Matching with Swaps for Short Patterns in Linear Time.
SOFSEM 2009: 255-266 |
| 20 | | Domenico Cantone,
Simone Faro,
Emanuele Giaquinta:
Adapting Boyer-Moore-Like Algorithms for Searching Huffman Encoded Texts.
Stringology 2009: 29-39 |
| 19 | | Matteo Campanelli,
Domenico Cantone,
Simone Faro,
Emanuele Giaquinta:
An Efficient Algorithm for Approximate Pattern Matching with Swaps.
Stringology 2009: 90-104 |
| 18 | | Domenico Cantone,
Salvatore Cristofaro,
Simone Faro:
New Efficient Bit-Parallel Algorithms for the (delta, alpha)-Matching Problem with Applications in Music Information Retrieval.
Int. J. Found. Comput. Sci. 20(6): 1087-1108 (2009) |
| 17 | | Simone Faro,
Thierry Lecroq:
Efficient Variants of the Backward-Oracle-Matching Algorithm.
Int. J. Found. Comput. Sci. 20(6): 967-984 (2009) |
| 2008 |
|---|
| 16 | | Domenico Cantone,
Salvatore Cristofaro,
Simone Faro,
Emanuele Giaquinta:
Finite State Models for the Generation of Large Corpora of Natural Language Texts.
FSMNLP 2008: 175-182 |
| 15 | | Simone Faro,
Thierry Lecroq:
Efficient Variants of the Backward-Oracle-Matching Algorithm.
Stringology 2008: 146-160 |
| 14 | | Domenico Cantone,
Salvatore Cristofaro,
Simone Faro:
New Efficient Bit-Parallel Algorithms for the delta-Matching Problem with alpha-Bounded Gaps in Musical Sequences.
Stringology 2008: 170184 |
| 13 | | Simone Faro,
Thierry Lecroq:
Efficient Pattern Matching on Binary Strings
CoRR abs/0810.2390: (2008) |
| 12 | | Domenico Cantone,
Salvatore Cristofaro,
Simone Faro:
On Some Combinatorial Problems Concerning the Harmonic Structure of Musical Chord Sequences.
Int. J. Found. Comput. Sci. 19(1): 103-124 (2008) |
| 2006 |
|---|
| 11 | | Domenico Cantone,
Salvatore Cristofaro,
Simone Faro:
On some combinatorial problems concerning the harmonic structure of musical chord sequences.
Stringology 2006: 49-64 |
| 10 | | Domenico Cantone,
Simone Faro:
A Space Efficient Bit-parallel Algorithm for the Multiple String Matching Problem.
Int. J. Found. Comput. Sci. 17(6): 1235-1252 (2006) |
| 2005 |
|---|
| 9 | | Domenico Cantone,
Salvatore Cristofaro,
Simone Faro:
On Tuning the (\delta, \alpha)-Sequential-Sampling Algorithm for \delta-Approximate Matching with Alpha-Bounded Gaps in Musical Sequences.
ISMIR 2005: 454-459 |
| 8 | | Domenico Cantone,
Salvatore Cristofaro,
Simone Faro:
Solving the (\delta, \alpha)-Approximate Matching Problem Under Transposition Invariance in Musical Sequences.
ISMIR 2005: 460-463 |
| 7 |  | Domenico Cantone,
Simone Faro:
A space efficient bit-parallel algorithm for the multiple string matching problem.
Stringology 2005: 109-124 |
| 6 | | Domenico Cantone,
Salvatore Cristofaro,
Simone Faro:
An Efficient Algorithm for alpha-Approximate Matching with delta-Bounded Gaps in Musical Sequences.
WEA 2005: 428-439 |
| 5 | | Domenico Cantone,
Simone Faro:
Fast-Search Algorithms: New Efficient Variants of the Boyer-Moore Pattern-Matching Algorithm.
Journal of Automata, Languages and Combinatorics 10(5/6): 589-608 (2005) |
| 2004 |
|---|
| 4 | | Domenico Cantone,
Simone Faro:
Two-Levels-Greedy: A Generalized of Dijkstra's Shortest Path Algorithm.
CTW 2004: 75-80 |
| 3 | | Domenico Cantone,
Salvatore Cristofaro,
Simone Faro:
Efficient Algorithms for the delta-Approximate String Matching Problem in Musical Sequences.
Stringology 2004: 33-47 |
| 2 | | Domenico Cantone,
Simone Faro:
Two-Levels-Greedy: a generalization of Dijkstra's shortest path algorithm.
Electronic Notes in Discrete Mathematics 17: 81-86 (2004) |
| 2003 |
|---|
| 1 | | Domenico Cantone,
Simone Faro:
Fast-Search: A New Efficient Variant of the Boyer-Moore String Matching Algorithm.
WEA 2003: 47-58 |
Data released under the ODC-BY 1.0 license — See also our legal information page