- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j13 |      | Simone Faro, Thierry Lecroq: The exact online string matching problem: A review of the most recent results. ACM Comput. Surv. 45(2): 13 (2013) |
| j12 | | Domenico Cantone, Salvatore Cristofaro, Simone Faro: Efficient string-matching allowing for non-overlapping inversions. Theor. Comput. Sci. 483: 85-95 (2013) |
| c29 | | Simone Faro, M. Oguzhan Külekci: Fast Packed String Matching for Short Patterns. ALENEX 2013: 113-121 |
| 2012 | ||
| j11 | | Domenico Cantone, Simone Faro, Emanuele Giaquinta: A compact representation of nondeterministic (suffix) automata for the bit-parallel approach. Inf. Comput. 213: 3-12 (2012) |
| j10 | | Matteo Campanelli, Domenico Cantone, Simone Faro, Emanuele Giaquinta: Pattern Matching with Swaps in Practice. Int. J. Found. Comput. Sci. 23(2): 323-342 (2012) |
| j9 | | 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) |
| j8 | | 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) |
| c28 | | Simone Faro, Thierry Lecroq: Fast searching in biological sequences using multiple hash functions. BIBE 2012: 175-180 |
| c27 | | Simone Faro, M. Oguzhan Külekci: Fast Multiple String Matching Using Streaming SIMD Extensions Technology. SPIRE 2012: 217-228 |
| c26 | | Simone Faro, Thierry Lecroq: A Multiple Sliding Windows Approach to Speed Up String Matching Algorithms. SEA 2012: 172-183 |
| c25 | | Simone Faro, Thierry Lecroq: A Fast Suffix Automata Based Algorithm for Exact Online String Matching. CIAA 2012: 149-158 |
| i5 | | Simone Faro, M. Oguzhan Külekci: Fast Packed String Matching for Short Patterns. CoRR abs/1209.6449 (2012) |
| 2011 | ||
| j7 | | 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) |
| c24 | | Domenico Cantone, Salvatore Cristofaro, Simone Faro: Efficient Matching of Biological Sequences Allowing for Non-overlapping Inversions. CPM 2011: 364-375 |
| c23 | | Simone Faro, Thierry Lecroq: 2001-2010: Ten Years of Exact String Matching Algorithms. Stringology 2011: 1-2 |
| 2010 | ||
| c22 | | Domenico Cantone, Simone Faro, Emanuele Giaquinta: A Compact Representation of Nondeterministic (Suffix) Automata for the Bit-Parallel Approach. CPM 2010: 288-298 |
| c21 | | Domenico Cantone, Simone Faro, Emanuele Giaquinta: Bit-(Parallelism)2: Getting to the Next Level of Parallelism. FUN 2010: 166-177 |
| c20 | | Simone Faro, Elisa Pappalardo: Ant-CSP: An Ant Colony Optimization Algorithm for the Closest String Problem. SOFSEM 2010: 370-381 |
| c19 | | Domenico Cantone, Simone Faro, Emanuele Giaquinta: Approximate String Matching Allowing for Inversions and Translocations. Stringology 2010: 37-51 |
| c18 | | Domenico Cantone, Salvatore Cristofaro, Simone Faro: A Space-Efficient Implementation of the Good-Suffix Heuristic. Stringology 2010: 63-75 |
| i4 | | 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) |
| i3 | | Domenico Cantone, Simone Faro: On Tuning the Bad-Character Rule: the Worst-Character Rule. CoRR abs/1012.1338 (2010) |
| i2 | | Simone Faro, Thierry Lecroq: The Exact String Matching Problem: a Comprehensive Experimental Evaluation. CoRR abs/1012.2547 (2010) |
| 2009 | ||
| j6 | | Simone Faro, Thierry Lecroq: Efficient Variants of the Backward-Oracle-Matching Algorithm. Int. J. Found. Comput. Sci. 20(6): 967-984 (2009) |
| j5 | | 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) |
| c17 | | Simone Faro, Thierry Lecroq: An Efficient Matching Algorithm for Encoded DNA Sequences and Binary Strings. CPM 2009: 106-115 |
| c16 | | Matteo Campanelli, Domenico Cantone, Simone Faro: A New Algorithm for Efficient Pattern Matching with Swaps. IWOCA 2009: 230-241 |
| c15 | | Domenico Cantone, Simone Faro: Pattern Matching with Swaps for Short Patterns in Linear Time. SOFSEM 2009: 255-266 |
| c14 | | Domenico Cantone, Simone Faro, Emanuele Giaquinta: Adapting Boyer-Moore-Like Algorithms for Searching Huffman Encoded Texts. Stringology 2009: 29-39 |
| c13 | | Matteo Campanelli, Domenico Cantone, Simone Faro, Emanuele Giaquinta: An Efficient Algorithm for Approximate Pattern Matching with Swaps. Stringology 2009: 90-104 |
| 2008 | ||
| j4 | | 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) |
| c12 | | 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 |
| c11 | | Simone Faro, Thierry Lecroq: Efficient Variants of the Backward-Oracle-Matching Algorithm. Stringology 2008: 146-160 |
| c10 | | 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 |
| i1 | | Simone Faro, Thierry Lecroq: Efficient Pattern Matching on Binary Strings. CoRR abs/0810.2390 (2008) |
| 2006 | ||
| j3 | | 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) |
| c9 | | Domenico Cantone, Salvatore Cristofaro, Simone Faro: On some combinatorial problems concerning the harmonic structure of musical chord sequences. Stringology 2006: 49-64 |
| 2005 | ||
| j2 |  | 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) |
| c8 | | 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 |
| c7 | | Domenico Cantone, Salvatore Cristofaro, Simone Faro: Solving the (\delta, \alpha)-Approximate Matching Problem Under Transposition Invariance in Musical Sequences. ISMIR 2005: 460-463 |
| c6 | | Domenico Cantone, Simone Faro: A space efficient bit-parallel algorithm for the multiple string matching problem. Stringology 2005: 109-124 |
| c5 | | Domenico Cantone, Salvatore Cristofaro, Simone Faro: An Efficient Algorithm for alpha-Approximate Matching with delta-Bounded Gaps in Musical Sequences. WEA 2005: 428-439 |
| 2004 | ||
| j1 | | Domenico Cantone, Simone Faro: Two-Levels-Greedy: a generalization of Dijkstra's shortest path algorithm. Electronic Notes in Discrete Mathematics 17: 81-86 (2004) |
| c4 | | Domenico Cantone, Simone Faro: Two-Levels-Greedy: A Generalized of Dijkstra's Shortest Path Algorithm. CTW 2004: 75-80 |
| c3 | | Domenico Cantone, Salvatore Cristofaro, Simone Faro: Efficient Algorithms for the delta-Approximate String Matching Problem in Musical Sequences. Stringology 2004: 33-47 |
| 2003 | ||
| c2 | | Domenico Cantone, Simone Faro: Forward-Fast-Search: Another Fast Variant of the Boyer-Moore String Matching Algorithm. Stringology 2003: 10-24 |
| c1 | | Domenico Cantone, Simone Faro: Fast-Search: A New Efficient Variant of the Boyer-Moore String Matching Algorithm. WEA 2003: 47-58 |
| 1 | Matteo Campanelli | |
| 2 | Domenico Cantone | |
| 3 | Salvatore Cristofaro | |
| 4 | Emanuele Giaquinta | |
| 5 | Szymon Grabowski | |
| 6 | M. Oguzhan Külekci | |
| 7 | Thierry Lecroq | |
| 8 | Elisa Pappalardo |
Data released under the ODC-BY 1.0 license — See also our legal information page