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.

2011-14 Evaluation

The ANVUR (The National Agency for the Evaluation of Universities and Research in Italy) performs a periodic evaluation of the quality of research products. Such evaluation is based on an algorithm and a set of parameters that you can find here.

Refereed International Conferences

[56]		Bit-Layers Text Encoding for Efficient Text Processing. SOFSEM (Doctoral Student Research Forum) pp.13-24 By Domenico Cantone, Simone Faro and Stefano Scafiti Published in 2020
[55]		Fast-Insertion-Sort: a New Family of Efficient Variants of the Insertion-Sort Algorithm SOFSEM (Doctoral Student Research Forum) pp. 37-48 By Simone Faro, Francesco Pio Marino and Stefano Scafiti Published in 2020
[54]		Sequence Searching Allowing for Non-Overlapping Adjacent Unbalanced Translocations WABI 2020: 19:1-19:14 By Domenico Cantone, Simone Faro and Arianna Pavone Published in 2020
[53]		Fast Multiple Pattern Cartesian Tree Matching WALCOM 2020: 107-119 By Geonmo Gu, Siwoo Song, Simone Faro, Thierry Lecroq and Kunsoo Park Published in 2020
[52]		Alignment of Sequences Allowing for Non-overlapping Unbalanced Translocations of Adjacent Factors IWBBIO 2019: 120-131 By Simone Faro and Arianna Pavone Published in 2019
[51]		Flexible and Efficient Algorithms for Abelian Matching in Genome Sequence IWBBIO 2019: 307-318 By Simone Faro and Arianna Pavone Published in 2019
[50]		Fast Cartesian Tree Matching. SPIRE 2019: 124-137 By Siwoo Song, Cheol Ryu, Simone Faro, Thierry Lecroq and Kunsoo Park Published in 2019
[49]		Speeding Up String Matching by Weak Factor Recognition Proceedings of the Stringology Conference 2017, PSC 2016, pp.42-50 By Domenico Cantone, Simone Faro and Arianna Pavone Published in 2017
[48]		Verifiable Pattern Matching on Outsourced Texts Proceedings of 10th International Conference on Security and Cryptography for Networks, Lecture Notes in Computer Science vol.9841, pp.333-350 By Dario Catalano, Mario Di Raimondo and Simone Faro Published in 2016
[47]		The String Matching Algorithms Research Tool Proceedings of the Stringology Conference 2016, PSC 2016, pp.99-111 By Simone Faro, Thierry Lecroq, Stefano Borzi, Simone Di Mauro and Alessandro Maggio Published in 2016
[46]		A Very Fast String Matching Algorithm Based on Condensed Alphabets Proceedings of the Eleventh International Conference on Algorithmic Aspects of Information and Management, Lecture Notes in Computer Science vol.9778, pp.65-76 By Simone Faro Published in 2016
[45]		Efficient Algorithms for the Order Preserving Pattern Matching Problem Proceedings of the Eleventh International Conference on Algorithmic Aspects of Information and Management, Lecture Notes in Computer Science vol.9778, pp.185-196 By Simone Faro and Oguzhan Kulekci Published in 2016
[44]		Evaluation and Improvement of Fast Algorithms for Exact Matching on Genome Sequences Proceedings of the 3rd Internanional Conference on Algorithms for Computational Biology, Lecture Notes in Computer Science vol.9702, pp.145-157 By Simone Faro Published in 2016
[43]		An Efficient Skip-Search Approach to the Order-Preserving Pattern Matching Problem Proceedings of the Prague Stringology Conference 2015, PSC 2015, pp.22-35 By Simone Faro, Oguzhan Kulekci and Domenico Cantone Published in 2015
[42]		Refined Tagging of Complex Verbal Phrases for the Italian Language Proceedings of the Prague Stringology Conference 2015, PSC 2015, pp.132-145 By Simone Faro and Arianna Pavone Published in 2015
[41]		Prior Polarity Lexical Resources for the Italian Language Proceedings of the 12th International Workshop on Natural Language Processing and Cognitive Science, pp.106-114 By V. Borzì, S. Faro, A. Pavone and S. Sansone Published in 2015
[40]		Short Read Alignment and Compression via Shortest Unique Substring Identiers Proceedings of the 3rd International Work-Conference on Bioinformatics and Biomedical Engineering, LNCS Vol.9044, pp.363-374 By B.Adas, E.Bayraktar, S.Faro, I.E.Moustafa and M.O.Kulekci Published in 2015
[39]		Automatic Extraction of Semantic Relations by Using Web Statistical Information Proceedings of the International Conference on Conceptual Structures 2014 (ICCS 2014), pp.174-187 By Valeria Borzì, Simone Faro and Arianna Pavone Published in 2014
[38]		Efficient Online Abelian Pattern Matching in Strings by Simulating Reactive Multi-Automata Proceedings of the Prague Stringology Conference 2014, PSC 2014, pp.30-42 By Simone Faro and Domenico Cantone Published in 2014
[37]		Swap Matching in Strings by Simulating Reactive Automata Proceedings of the Prague Stringology Conference 2013, PSC 2013, pp.7-20 By Simone Faro Published in 2013
[36]		Towards a Very Fast Multiple String Matching Algorithm for Short Patterns Proceedings of the Prague Stringology Conference 2013, PSC 2013, pp.78-91 By Simone Faro and Oguzhan Kulekci Published in 2013
[35]		Improved and Self-Tuned Occurrence Heuristics Proceedings of the Prague Stringology Conference 2013, PSC 2013, pp.92-106 By Simone Faro and Domenico Cantone Published in 2013
[34]		Fast Packed String Matching for Short Patterns Proceedings of the International Meeting on Algorithm Engineering and Experiments (ALENEX13), pp.113-121 By Simone Faro and Oguzhan Kulekci Published in 2013
[33]		Fast Searching in Biological Sequences Using Multiple Hash Functions Proceedings of the 12th IEEE International Conference on BioInformatics and BioEngineering (BIBE), pp. 175-180 By Simone Faro and Thierry Lecroq Published in 2012
[32]		Fast Multiple String Matching Using Streaming SIMD Extensions Technology Proceedings of the 19th International Symposium on String Processing and Information Retrieval (SPIRE), Lecture Notes in Computer Science, 2012, Volume 7608, pp. 217-228 By Simone Faro and Oguzhan Kulekci Published in 2012
[31]		A Fast Suffix Automata Based Algorithm for Exact Online String Matching Proceedings of the 17th International Conference on Implementation and Application of Automata (CIAA), Lecture Notes in Computer Science, 2012, Volume 7381, pp. 149-158 By Simone Faro and Thierry Lecroq Published in 2012
[30]		A Multiple Sliding Windows Approach to Speed Up String Matching Algorithms Proceedings of the 11-th International Symposium on Experimental Algorithms (SEA), Lecture Notes in Computer Science, 2012, Volume 7276/2012, pp.172-183 By Simone Faro and Thierry Lecroq Published in 2012
[29]		2001–2010: Ten Years of Exact String Matching Algorithms Proceedings of the Prague Stringology Conference 2011, PSC 2011, pp.1-2 By Simone Faro and Thierry Lecroq Published in 2011
[28]		Efficient Matching of Biological Sequences Allowing for Non-Overlapping Inversions In Proceedings of the 22nd Annual Symposium on Combinatorial Pattern Matching, CPM 2011, Lecture Notes in Computer Science, 2011, Volume 6661/2011, pp.364-375 By Domenico Cantone, Salvatore Cristofaro and Simone Faro Published in 2011
[27]		Approximate String Matching Allowing for Inversions and Translocations In J.Holub and J.Zdarek (Eds.), Proceedings of the Prague Stringology Conference 2010, PSC 2010, pp.37-51 By Domenico Cantone, Simone Faro and Emanuele Giaquinta Published in 2010
[26]		A Space-Efficient Implementation of the Good-Suffix Heuristic In J.Holub and J.Zdarek (Eds.), Proceedings of the Prague Stringology Conference 2010, PSC 2010, pp.63-75 By Domenico Cantone and Simone Faro Published in 2010
[25]		A Compact Representation of Nondeterministic (Suffix) Automata for the Bit-Parallel Approach In Proceedings of the 21st Annual Symposium on Combinatorial Pattern Matching, CPM 2010, Lecture Notes in Computer Science, 2010, Volume 6129/2010, pp. 288-298 By Domenico Cantone, Simone Faro and Emanuele Giaquinta Published in 2010
[24]		Bit-(Parallelism)^2: Getting to the Next Level of Parallelism In Proceedings of the Fifth International Conference on Fun With Algorithms, FUN 2010, Lecture Notes in Computer Science, 2010, Volume 6099/2010, pp.166-177 By Domenico Cantone, Simone Faro and Emanuele Giaquinta Published in 2010
[23]		Ant-CSP: an Ant Colony Optimization Algorithm for the Closest String Problem In 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-381 By Simone Faro and Elisa Pappalardo Published in 2010
[22]		Efficient Pattern Matching on Binary Strings In 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 By Simone Faro and Thierry Lecroq Published in 2009
[21]		Pattern Matching with Swaps for Short Patterns in Linear Time In 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-266 By 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 Arcs In 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 By Domenico Cantone and Simone Faro Published in 2009
[19]		An efficient matching algorithm for encoded DNA sequences and binary strings In Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching (CPM 2009). Lecture Notes In Computer Science, Vol. 5577, Springer-Verlag, pp.106-115 By Simone Faro and Thierry Lecroq Published in 2009
[18]		A New Algorithm for Efficient Pattern Matching with Swaps In Proceedings of the 20th International Workshop on Combinatorial Algorithms (IWOCA 2009). Lecture Notes In Computer Science, Vol. 5874, Springer-Verlag, pp.230-241 By Matteo Campanelli, Domenico Cantone and Simone Faro Published in 2009
[17]		An Efficient Algorithm for Approximate Pattern Matching with Swaps In J.Holub and J.Zdarek (Eds.), Proceedings of the 14th Prague Stringology Conference (PSC 2009), Prague, Czech Republic, pp. 90-104 By Matteo Campanelli, Domenico Cantone, Simone Faro and Emanuele Giaquinta Published in 2009
[16]		Adapting Boyer-Moore-Like Algorithms for Searching Huffman Encoded Texts In J.Holub and J.Zdarek (Eds.), Proceedings of the 14th Prague Stringology Conference (PSC 2009), Prague, Czech Republic, pp. 29-39 By Domenico Cantone, Simone Faro and Emanuele Giaquinta Published in 2009
[15]		Efficient Variants of the Backward-Oracle-Matching Algorithm In J. Zdarek and J. Holub (Eds.), Proceedings of the 13th Prague Stringology Conference (PSC 2008), Prague, Czech Republic, September 2008, pp. 146-160 By Simone Faro and Thierry Lecroq Published in 2008
[14]		New Efficient Bit-Parallel Algorithms for the Delta-Matching Problem with Alpha-Bounded Gaps In J. Zdarek and J. Holub (Eds.), Proceedings of the 13th Prague Stringology Conference (PSC 2008), Prague, Czech Republic, September 2008, pp. 170-184 By Domenico Cantone, Salvatore Cristofaro and Simone Faro Published in 2008
[13]		Finite State Models for the Generation of Large Corpora of Natural Language Texts In Proceedings of the Seventh International Workshop on Finite-State Methods and Natural Language Processing (FSMNLP 2008), Ispra, Lago Maggiore By Simone Faro, Domenico Cantone, Salvatore Cristofaro, Emanuele Giaquinta Published in 2008
[12]		Pattern Matching for Control Chart Monitoring In Progress in Industrial Mathematics at ECMI 2006, Mathematics in Industry, Volume 12, Springer Berlin Heidelberg, pp. 918-922 By Domenico Cantone and Simone Faro Published in 2007
[11]		On some Combinatorial Problems concerning the Harmonic Structure of Musical Chord Sequences In M. Simanek and J. Holub (Eds.), Proc. Of the Prague Stringology Conference '06, Czech Technical University, Prague, Czech Republic By Domenico Cantone, Salvatore Cristofaro and Simone Faro Published in 2006
[10]		An Efficient Algorithm for delta-Approximate-Matching with alpha-Bounded Gaps in Musical Sequences In 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-439 By 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 Sequences In Proceedings of 6th International Conference on Music Information Retrieval, ISMIR By Domenico Cantone, Salvatore Cristofaro and Simone Faro Published in 2005
[8]		Solving The (Delta, Alpha)-Approximate Matching Problem Under Transposition Invariance In Musical Sequences In Proceedings of 6th International Conference on Music Information Retrieval, ISMIR By Domenico Cantone, Salvatore Cristofaro and Simone Faro Published in 2005
[7]		A Space Efficient Bit-Parallel Algorithm for the Multiple String Matching Problem In M. Simanek and J. Holub (Eds.), Proc. Of the Prague Stringology Conference '05, Czech Technical University, Prague, Czech Republic, pp. 109-124 By Domenico Cantone and Simone Faro Published in 2005
[6]		Searching for a substring with constant extra space complexity In 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-131 By Domenico Cantone and Simone Faro Published in 2004
[5]		Two Levels Greedy: an improvement of the Dijkstra shortest path algorithm In 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 Sequences In M. Simanek and J. Holub (Eds.), Proc. Of the Prague Stringology Conference '04, Czech Technical University, Prague, Czech Republic, pp. 33-47 By Domenico Cantone, Salvatore Cristofaro and Simone Faro Published in 2004
[3]		Fast-Search: a New Efficient Variant of the Boyer-Moore String Matching Algorithm In 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-58 By Domenico Cantone and Simone Faro Published in 2003
[2]		Forward-Fast-Search: Another Fast Variant of the Boyer-Moore String Matching Algorithm In M. Simanek (Ed.) In Proc. of the Prague Stringology Conference '03, Czech Technical University, Prague, Czech Republic, pp. 10-24 By Domenico Cantone and Simone Faro Published in 2003
[1]		On the Frequency of Characters in Natural Language Texts In F. Spoto, G. Scollo, and A. Nijholt (Eds.), Proc. Of Algebraic Methods in Language Processing 2003, II AMAST Workshop On Language Processing, pp. 69-82 By Domenico Cantone and Simone Faro Published in 2003

Publications

2011-14 Evaluation

Refereed International Conferences

[56]

[55]

[54]

[53]

Fast Multiple Pattern Cartesian Tree Matching

[52]

[51]

[50]

[49]

[48]

[47]

[46]

[45]

[44]

[43]

[42]

[41]

[40]

[39]

[38]

[37]

[36]

[35]

[34]

[33]

[32]

[31]

[30]

[29]

[28]

[27]

[26]

[25]

[24]

[23]

[22]

[21]

[20]

[19]

[18]

[17]

[16]

[15]

[14]

[13]

[12]

Pattern Matching for Control Chart Monitoring

[11]

[10]

[9]

[8]

[7]

[6]

[5]

[4]

[3]

[2]

[1]