• Home
• Teachings
• Publications
• Research
• Events
• Contact

SELECTED PUBLICATIONS

International Journal

1. Domenico Cantone and Simone Faro. Two Levels Greedy: an improvement of the Dijkstra shortest path algorithm. Electronic Notes in Discrete Mathematics, Volume 17, pp. 81-86, 2004
   


2. Domenico Cantone, Simone Faro. Fast-Search Algorithms: New Efficient Variants of the Boyer-Moore Pattern-Matching Algorithm. Journal of Automata, Languages and Combinatorics, Vol. 10(5/6): pp. 589-608 (2005)
   


3. Domenico Cantone, Simone Faro. A Space Efficient Bit-parallel Algorithm for the Multiple String Matching Problem. International Journal of Foundation of Computer Science, Vol. 17(6): pp. 1235-1252 (2006)
   


4. Domenico Cantone, Salvatore Cristofaro and Simone Faro. On Some Combinatorial Problems Concerning the Harmonic Structure of Musical Chord Sequences. International Journal of Foundation of Computer Science, Vol. 19(1): pp. 103-124 (2008)


5. Domenico Cantone, Salvatore Cristofaro and Simone Faro. New Efficient Bit-Parallel Algorithms for the Delta-Matching Problem with Alpha-Bounded Gaps. International Journal of Foundation of Computer Science, Vol. 20(6): pp. 1087-1108 (2009).


6. Simone Faro and Thierry Lecroq. Efficient Variants of the Backward-Oracle-Matching Algorithm. International Journal of Foundation of Computer Science, Vol 20(6): pp. 967-984 (2009).

International Conference Proceedings

• Published in 2010
23. Elisa Pappalardo and Simone Faro: 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 (2010)


• Published in 2009
22. Simone Faro and Thierry Lecroq. 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


21. Domenico Cantone and Simone Faro. 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 (2009)


20. Domenico Cantone and Simone Faro. 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


19. Simone Faro and Thierry Lecroq. 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, (2009)


18. Matteo Campanelli, Domenico Cantone and Simone Faro. 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, (2009)


17. Matteo Campanelli, Domenico Cantone, Simone Faro and Emanuele Giaquinta. 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, (2009)


16. Domenico Cantone, Simone Faro and Emanuele Giaquinta. 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, (2009)


• Published in 2008
15. Simone Faro and Thierry Lecroq. 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, (2008)


14. Domenico Cantone, Salvatore Cristofaro and Simone Faro. 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, (2008)


13. Simone Faro, Domenico Cantone, Salvatore Cristofaro, Emanuele Giaquinta. 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, September 2008.


• Published in 2007
12. Domenico Cantone and Simone Faro. 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, 2007.


• Published in 2006
11. Domenico Cantone, Salvatore Cristofaro and Simone Faro. 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, 2006


• Published in 2005
10. Domenico Cantone, Salvatore Cristofaro and Simone Faro. 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, 2005


9. Domenico Cantone, Salvatore Cristofaro and Simone Faro. 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 2005.


8. Domenico Cantone, Salvatore Cristofaro and Simone Faro. Solving The (Delta, Alpha)-Approximate Matching Problem Under Transposition Invariance In Musical Sequences. In Proceedings of 6th International Conference on Music Information Retrieval, ISMIR 2005.


7. Domenico Cantone and Simone Faro. 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, 2005.


• Published in 2004
6. Domenico Cantone and Simone Faro. 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, 2004.


5. Domenico Cantone and Simone Faro. Two Levels Greedy: an improvement of the Dijkstra shortest path algorithm. In Proc. of Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2004), 2004


4. Domenico Cantone, Salvatore Cristofaro and Simone Faro. 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, 2004.


• Published in 2003
3. Domenico Cantone and Simone Faro. 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, 2003.


2. Domenico Cantone and Simone Faro, 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, 2003.


1. Domenico Cantone and Simone Faro. 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, 2003.

International Papers without Referee

1. Simone Faro and Thierry Lecroq. Efficient pattern matching on binary strings. Report arXiv:0810.2390, Cornell University Library, 2008. url: http://arxiv.org/abs/0810.2390.
   [PS file] [PDF file]

Ph.D. Thesis

1. Simone Faro, Practical and Theoretical Aspects of String Matching algorithms. PhD Thesis, Department of Mathematics and Computer Science, University of Catania, December 2004.
   [PDF file]

Hosted by Department of Mathematics and Computer Science | University of Catania
Viale A.Doria n.6 - 95125 - Catania. | tel.+39 095 738 3053