Publications
Most of the papers listed on this page are available in pdf format.
If the article you are interested in is not available do not esitate to contact me.
Please, note also that many of the papers on this page are subject to copyright limitations.
You are free to download a copy of such publications for personal use only.
International Journals
International Conferences
Technical Reports
List of publications at DBLP
List of papers at Google Scholar
Papers at Prague Stringology Conference
Refereed International Conferences
[34] | Fast Packed String Matching for Short PatternsProceedings of the International Meeting on Algorithm Engineering and Experiments (ALENEX13), pp.113-121By Simone Faro and Oguzhan Kulekci Published in 2013 |
[33] | Fast Searching in Biological Sequences Using Multiple Hash FunctionsProceedings of the 12th IEEE International Conference on BioInformatics and BioEngineering (BIBE), pp. 175-180By Simone Faro and Thierry Lecroq Published in 2012 |
[32] | Fast Multiple String Matching Using Streaming SIMD Extensions TechnologyProceedings of the 19th International Symposium on String Processing and Information Retrieval (SPIRE), Lecture Notes in Computer Science, 2012, Volume 7608, pp. 217-228By Simone Faro and Oguzhan Kulekci Published in 2012 |
[31] | A Fast Suffix Automata Based Algorithm for Exact Online String MatchingProceedings of the 17th International Conference on Implementation and Application of Automata (CIAA), Lecture Notes in Computer Science, 2012, Volume 7381, pp. 149-158By Simone Faro and Thierry Lecroq Published in 2012 |
[30] | A Multiple Sliding Windows Approach to Speed Up String Matching AlgorithmsProceedings of the 11-th International Symposium on Experimental Algorithms (SEA), Lecture Notes in Computer Science, 2012, Volume 7276/2012, pp.172-183By Simone Faro and Thierry Lecroq Published in 2012 |
[29] | 2001–2010: Ten Years of Exact String Matching AlgorithmsProceedings of the Prague Stringology Conference 2011, PSC 2011, pp.1-2By Simone Faro and Thierry Lecroq Published in 2011 |
[28] | Efficient Matching of Biological Sequences Allowing for Non-Overlapping InversionsIn Proceedings of the 22nd Annual Symposium on Combinatorial Pattern Matching, CPM 2011, Lecture Notes in Computer Science, 2011, Volume 6661/2011, pp.364-375By Domenico Cantone, Salvatore Cristofaro and Simone Faro Published in 2011 |
[27] | Approximate String Matching Allowing for Inversions and TranslocationsIn J.Holub and J.Zdarek (Eds.), Proceedings of the Prague Stringology Conference 2010, PSC 2010, pp.37-51By Domenico Cantone, Simone Faro and Emanuele Giaquinta Published in 2010 |
[26] | A Space-Efficient Implementation of the Good-Suffix HeuristicIn J.Holub and J.Zdarek (Eds.), Proceedings of the Prague Stringology Conference 2010, PSC 2010, pp.63-75By Domenico Cantone and Simone Faro Published in 2010 |
[25] | A Compact Representation of Nondeterministic (Suffix) Automata for the Bit-Parallel ApproachIn Proceedings of the 21st Annual Symposium on Combinatorial Pattern Matching, CPM 2010, Lecture Notes in Computer Science, 2010, Volume 6129/2010, pp. 288-298By Domenico Cantone, Simone Faro and Emanuele Giaquinta Published in 2010 |
[24] | Bit-(Parallelism)^2: Getting to the Next Level of ParallelismIn Proceedings of the Fifth International Conference on Fun With Algorithms, FUN 2010, Lecture Notes in Computer Science, 2010, Volume 6099/2010, pp.166-177By Domenico Cantone, Simone Faro and Emanuele Giaquinta Published in 2010 |
[23] | Ant-CSP: an Ant Colony Optimization Algorithm for the Closest String ProblemIn Proceedings of the 36th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2010), Lecture Notes in Computer Science, Vol.5901 Springer Berlin, pp.370-381By Simone Faro and Elisa Pappalardo Published in 2010 |
[22] | Efficient Pattern Matching on Binary StringsIn Proceedings of the 35th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2009), January 24-30, 2009, Hotel Arnika, Spindleruv Mlyn, Czech RepublicBy Simone Faro and Thierry Lecroq Published in 2009 |
[21] | Pattern Matching with Swaps for Short Patterns in Linear TimeIn Proceedings of the 35th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2009). January 24-30, 2009, Hotel Arnika, Spindleruv Mlyn, Czech Republic. Lecture Notes In Computer Science, Vol. 5404, Springer Berlin, pp.255-266By Domenico Cantone and Simone Faro Published in 2009 |
[20] | A Faster Algorithm for the Single Source Shortest Path Problem in the Presence of Few Sources or Destinations of Negative ArcsIn Proceedings of the 35th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2009). January 24-30, 2009, Hotel Arnika, Spindleruv Mlyn, Czech RepublicBy Domenico Cantone and Simone Faro Published in 2009 |
[19] | An efficient matching algorithm for encoded DNA sequences and binary stringsIn Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching (CPM 2009). Lecture Notes In Computer Science, Vol. 5577, Springer-Verlag, pp.106-115By Simone Faro and Thierry Lecroq Published in 2009 |
[18] | A New Algorithm for Efficient Pattern Matching with SwapsIn Proceedings of the 20th International Workshop on Combinatorial Algorithms (IWOCA 2009). Lecture Notes In Computer Science, Vol. 5874, Springer-Verlag, pp.230-241By Matteo Campanelli, Domenico Cantone and Simone Faro Published in 2009 |
[17] | An Efficient Algorithm for Approximate Pattern Matching with SwapsIn J.Holub and J.Zdarek (Eds.), Proceedings of the 14th Prague Stringology Conference (PSC 2009), Prague, Czech Republic, pp. 90-104By Matteo Campanelli, Domenico Cantone, Simone Faro and Emanuele Giaquinta Published in 2009 |
[16] | Adapting Boyer-Moore-Like Algorithms for Searching Huffman Encoded TextsIn J.Holub and J.Zdarek (Eds.), Proceedings of the 14th Prague Stringology Conference (PSC 2009), Prague, Czech Republic, pp. 29-39By Domenico Cantone, Simone Faro and Emanuele Giaquinta Published in 2009 |
[15] | Efficient Variants of the Backward-Oracle-Matching AlgorithmIn J. Zdarek and J. Holub (Eds.), Proceedings of the 13th Prague Stringology Conference (PSC 2008), Prague, Czech Republic, September 2008, pp. 146-160By Simone Faro and Thierry Lecroq Published in 2008 |
[14] | New Efficient Bit-Parallel Algorithms for the Delta-Matching Problem with Alpha-Bounded GapsIn J. Zdarek and J. Holub (Eds.), Proceedings of the 13th Prague Stringology Conference (PSC 2008), Prague, Czech Republic, September 2008, pp. 170-184By Domenico Cantone, Salvatore Cristofaro and Simone Faro Published in 2008 |
[13] | Finite State Models for the Generation of Large Corpora of Natural Language TextsIn Proceedings of the Seventh International Workshop on Finite-State Methods and Natural Language Processing (FSMNLP 2008), Ispra, Lago MaggioreBy Simone Faro, Domenico Cantone, Salvatore Cristofaro, Emanuele Giaquinta Published in 2008 |
[12] | Pattern Matching for Control Chart MonitoringIn Progress in Industrial Mathematics at ECMI 2006, Mathematics in Industry, Volume 12, Springer Berlin Heidelberg, pp. 918-922By Domenico Cantone and Simone Faro Published in 2007 |
[11] | On some Combinatorial Problems concerning the Harmonic Structure of Musical Chord SequencesIn M. Simanek and J. Holub (Eds.), Proc. Of the Prague Stringology Conference '06, Czech Technical University, Prague, Czech RepublicBy Domenico Cantone, Salvatore Cristofaro and Simone Faro Published in 2006 |
[10] | An Efficient Algorithm for delta-Approximate-Matching with alpha-Bounded Gaps in Musical SequencesIn S.E. Nikoletseas (Ed.), Proc. of 4th International Workshop on Experimental and Efficient Algorithms (WEA 2005), Lecture Notes in Computer Science, Springer, Vol. 3503, pp. 428-439By Domenico Cantone, Salvatore Cristofaro and Simone Faro Published in 2005 |
[9] | On Tuning The (Delta,Alpha)-Sequential-Sampling Algorithm For Delta-Approximate Matching With Alpha-Bounded Gaps In Musical SequencesIn Proceedings of 6th International Conference on Music Information Retrieval, ISMIRBy Domenico Cantone, Salvatore Cristofaro and Simone Faro Published in 2005 |
[8] | Solving The (Delta, Alpha)-Approximate Matching Problem Under Transposition Invariance In Musical SequencesIn Proceedings of 6th International Conference on Music Information Retrieval, ISMIRBy Domenico Cantone, Salvatore Cristofaro and Simone Faro Published in 2005 |
[7] | A Space Efficient Bit-Parallel Algorithm for the Multiple String Matching ProblemIn M. Simanek and J. Holub (Eds.), Proc. Of the Prague Stringology Conference '05, Czech Technical University, Prague, Czech Republic, pp. 109-124By Domenico Cantone and Simone Faro Published in 2005 |
[6] | Searching for a substring with constant extra space complexityIn P. Ferragina and R. Grossi (Eds.), Proc. Of the Third International Conference on FUN with Algorithms (FUN 2004), Edizioni Plus, University of Pisa, pp. 118-131By Domenico Cantone and Simone Faro Published in 2004 |
[5] | Two Levels Greedy: an improvement of the Dijkstra shortest path algorithmIn Proc. of Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2004)By Domenico Cantone and Simone Faro Published in 2004 |
[4] | Efficient Algorithms for the delta-Approximate String Matching Problem in Musical SequencesIn M. Simanek and J. Holub (Eds.), Proc. Of the Prague Stringology Conference '04, Czech Technical University, Prague, Czech Republic, pp. 33-47By Domenico Cantone, Salvatore Cristofaro and Simone Faro Published in 2004 |
[3] | Fast-Search: a New Efficient Variant of the Boyer-Moore String Matching AlgorithmIn K. Jansen, M. Margraf, M. Mastrolilli, J.D.P. Rolim (Eds.), Proc. Of Second International Workshop on Experimental Algorithms (WEA 2003), Lecture Notes in Computer Science, Springer, Vol. 2647, pp. 47-58By Domenico Cantone and Simone Faro Published in 2003 |
[2] | Forward-Fast-Search: Another Fast Variant of the Boyer-Moore String Matching AlgorithmIn M. Simanek (Ed.) In Proc. of the Prague Stringology Conference '03, Czech Technical University, Prague, Czech Republic, pp. 10-24By Domenico Cantone and Simone Faro Published in 2003 |
[1] | On the Frequency of Characters in Natural Language TextsIn F. Spoto, G. Scollo, and A. Nijholt (Eds.), Proc. Of Algebraic Methods in Language Processing 2003, II AMAST Workshop On Language Processing, pp. 69-82By Domenico Cantone and Simone Faro Published in 2003 |