Simone FARO

ARTICOLI SU RIVISTE INTERNAZIONALI

1. Simone Faro, Stefano Scafiti. Compact suffix automata representations for searching long patterns. Theoretical Computer Science, vol.940: pp.254-268 (2023). doi:10.1016/j.tcs.2022.11.005
2. Simone Faro, Stefano Scafiti. A weak approach to suffix automata simulation for exact and approximate string matching. Theoretical Computer Science Vol.933: pp.88-103 (2022). doi:10.1016/j.tcs.2022.08.028
3. Siwoo Song, Geonmo Gu, Cheol Ryu, Simone Faro, Thierry Lecroq, Kunsoo Park. Fast algorithms for single and multiple pattern Cartesian tree matching. Theor. Comput. Sci. 849: 47-63, 2021. doi:10.1016/j.tcs.2020.10.009
4. Simone Faro, Francesco Pio Marino and Arianna Pavone Pavone. Efficient Online String Matching Based on Characters Distance Text Sampling. Algorithmica, Springer, 2020. doi:10.1007/s00453-020-00732-4
5. Domenico Cantone, Simone Faro and M. Oguzhan Ku ̈lekci. The order-preserving pattern matching problem in practice. Discrete Applied Mathematics, Elsevier, Vol. 274: pp.11- 25, 2020. doi:10.1016/j.dam.2018.10.023
6. Domenico Cantone, Simone Faro and Arianna Pavone. Linear and Efficient String Matching Algorithms Based on Weak Factor Recognition. ACM Journal of Experimental Algorithmics, Vol. 24(1): pp. 1.8:1-1.8:20, 2019. doi:10.1145/3301295
7. Simone Faro and Arianna Pavone. An Efficient Skip-Search Approach to Swap Matching. Computer Journal, Oxford University Press, Vol.61(9): pp. 1351-1360, 2018. doi:10.1093/comjnl/bxx123
8. Dario Catalano, Mario Di Raimondo and Simone Faro: Verifiable pattern matching on outsourced texts. Journal of Discrete Algorithms, Elsevier, Vol.51: pp. 39-50, 2018. doi:10.1016/j.jda.2018.08.002
9. Tamanna Chhabra, Simone Faro, M. Oguzhan Kulekci, Jorma Tarhio. Engineering order-preserving pattern matching with SIMD parallelism. Software: Practice and Experience, Vol.47 (5): pp.731-739, 2017. doi:10.1002/spe.2433
10. Domenico Cantone, Simone Faro and Emanuele Giaquinta. Text Searching Allowing for Inversions and Translocations of Factors. Discrete Applied Mathematics, Vol.163: pp.247-257, 2014. doi:10.1016/j.dam.2013.05.016
11. Domenico Cantone and Simone Faro. Fast Shortest-Paths Algorithms in the Presence of few Destinations of Negative-Weight Arcs. Journal of Discrete Algorithms, Vol.24: pp.12-25, 2014. doi:10.1016/j.jda.2013.03.005
12. Simone Faro and Oguzhan Kulekci. Fast and Flexible Packed String Matching. Journal of Discrete Algorithms, Vol.28: pp.61-72, 2014. doi:10.1016/j.jda.2014.07.003
13. Domenico Cantone and Simone Faro. Improved and Self-Tuned Occurrence Heuristics Journal of Discrete Algorithms, Vol.28: pp.73-84, 2014. doi:10.1016/j.jda.2014.07.006
14. Domenico Cantone, Salvatore Cristofaro and Simone Faro. Efficient String-Matching Allowing for Non-Overlapping Inversions. Theoretical Computer Science, Volume 483, pp. 85-95, 2013. doi:10.1016/j.tcs.2012.06.009
15. Simone Faro and Thierry Lecroq,. The Exact Online String Matching Problem: a Review of the Most Recent Results. ACM Computing Surveys. Vol. 45(2), p.13, 2013. doi:10.1145/2431211.2431212
16. Domenico Cantone, Simone Faro and Emanuele Giaquinta. A Compact Representation of Nondeterministic (Suffix) Automata for the Bit-Parallel Approach. Information and Computation, Volume 213, pp. 3-12, 2012. doi:10.1016/j.ic.2011.03.006
17. Domenico Cantone, Simone Faro and Emanuele Giaquinta. On the bit-parallel simulation of the nondeterministic Aho-Corasick and suffix automata for a set of patterns. Journal of Discrete Algorithms, Volume 11, pp. 25-36, 2012. doi:10.1016/j.jda.2011.02.001
18. Domenico Cantone, Simone Faro and Emanuele Giaquinta. Adapting Boyer-Moore-Like Algorithms for Searching Huffman Encoded Texts. International Journal of Foundation of Computer Science, Volume 23(2), pp. 343-356, 2012. doi:10.1142/S0129054112400163
19. Matteo Campanelli, Domenico Cantone, Simone Faro and Emanuele Giaquinta. Pattern Matching with Swaps in Practice. International Journal of Foundation of Computer Science, Volume 23(2), pp. 323-342, 2012. doi:10.1142/S0129054112400163
20. Szymon Grabowski, Simone Faro and Emanuele Giaquinta. String Matching with Inversions and Translocations in Linear Average Time (Most of the Time). Information Processing Letters, Volume 111 Issue 11, May 2011. doi:10.1016/j.ipl.2011.02.015
21. Domenico Cantone, Salvatore Cristofaro and Simone Faro. New Efficient Bit-Parallel Algorithms for the (δ, α)-Matching Problem with Applications in Music Information Retrieval. International Journal of Foundation of Computer Science, Vol. 20(6): pp. 1087-1108, 2009. doi:10.1142/S0129054109007054
22. 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. doi:10.1142/S0129054109006991
23. 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. doi:10.1142/S0129054108005565
24. Domenico Cantone and 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. doi:10.1142/S0129054106004388
25. Domenico Cantone and 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.
26. 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. doi:10.1016/j.endm.2004.03.019

ARTICOLI SU CONFERENZE INTERNAZIONALI

1. Simone Faro, Stefano Scafiti. The Range Automaton: An Efficient Approach to Text- Searching. Proceedings of the 13th International Conference Combinatorics on Words, WORDS 2021, LNCS vol.12847, pp.91-103, 2021.
2. Simone Faro, Francesco Pio Marino, Arianna Pavone. Enhancing Characters Distance Text Sampling by Condensed Alphabets. Proceedings of the 22nd Italian Conference on Theoretical Computer Science, ICTCS 2021. CEUR Workshop Proceedings vol.3072, pp.1-15, 2021.
3. Simone Faro, Stefano Scafiti. Pruned BNDM: Extending the Bit-Parallel Suffix Automata to Large Strings. Proceedings of the 22nd Italian Conference on Theoretical Computer Science, ICTCS 2021. CEUR Workshop Proceedings vol.3072, pp.328-340, 2021.
4. Simone Faro, Francesco Pio Marino, Arianna Pavone, Antonio Scardace. Towards an Efficient Text Sampling Approach for Exact and Approximate Matching. Proceedings of the Prague Stringology Conference 2021, pp.75-89, 2021.
5. Simone Faro, Stefano Scafiti. Efficient String Matching Based on a Two-Step Simulation of the Suffix Automaton. Proceedings of the 25th International Conference on Implementation and Application of Automata, CIAA 2021 CIAA 2021. LNCS vol. 12803, pp.165-177 doi:10.1007/978-3-030-79121-6 14
6. Domenico Cantone, Simone Faro, M. Oguzhan Ku ̈lekci. Shape-Preserving Pattern Matching. Proceedings of the 21st Italian Conference on Theoretical Computer Science, ICTCS 2020, CEUR Workshop Proceedings, vol. 2756, pp.137-148, 2020.
7. Simone Faro, Thierry Lecroq, Kunsoo Park. Fast Practical Computation of the Longest Common Cartesian Substrings of Two Strings. Proceedings of the Prague Stringology Conference 2020, pp.48-60, 2020.
8. Simone Faro, Francesco Pio Marino. Reducing Time and Space in Indexed String Matching by Characters Distance Text Sampling. Proceedings of the Prague Stringology Conference 2020, pp.148-159, 2020.
9. Domenico Cantone, Simone Faro, Arianna Pavone. Sequence Searching Allowing for Non-Overlapping Adjacent Unbalanced Translocations. Proceedings of the 20th International Workshop on Algorithms in Bioinformatics WABI 2020, LIPIcs vol.19, pp.1-19:14, 2020. doi:10.4230/LIPIcs.WABI.2020.19
10. Domenico Cantone, Simone Faro, Stefano Scafiti. Bit-Layers Text Encoding for Efficient Text Processing. Proceedings of the SOFSEM 2020 Doctoral Student Research Forum co-located with the 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2020), CEUR Workshop Proceedings, Vol.2568, pp. 13-24, 2020.
11. Simone Faro, Francesco Pio Marino, Stefano Scafiti. Fast-Insertion-Sort: a New Family of Efficient Variants of the Insertion-Sort Algorithm. Proceedings of the SOFSEM 2020 Doctoral Student Research Forum co-located with the 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2020), CEUR Workshop Proceedings, Vol.2568, pp. 37-48, 2020.
12. Geonmo Gu, Siwoo Song, Simone Faro, Thierry Lecroq, Kunsoo Park. Fast Multiple Pattern Cartesian Tree Matching. Proceedings of WALCOM: Algorithms and Computation - 14th International Conference, WALCOM 2020, LNCS Vol.12049, pp. 107-119, 2020. doi:10.1007/978-3-030-39881-1 10
13. Simone Faro and Arianna Pavone. Alignment of Sequences Allowing for Non-overlapping Unbalanced Translocations of Adjacent Factors. Proceedings of Bioinformatics and Biomedical Engineering - 7th International Work-Conference, IWBBIO 2019, LNCS Vol.11465, pp. 120-131, 2019. doi:10.1007/978-3-030-17938-0 12
14. Simone Faro and Arianna Pavone. Flexible and Efficient Algorithms for Abelian Matching in Genome Sequence. Proceedings of Bioinformatics and Biomedical Engineering - 7th International Work-Conference, IWBBIO 2019, LNCS Vol.11465, pp. 307-318, 2019. doi:10.1007/978-3-030-17938-0 12
15. Siwoo Song, Cheol Ryu, Simone Faro, Thierry Lecroq and Kunsoo Park. Fast Cartesian Tree Matching. Proceedings of String Processing and Information Retrieval - 26th International Symposium, SPIRE 2019, pp. 124-137, 2019. doi:10.1007/978-3-030-32686-9 9
16. Domenico Cantone, Simone Faro, Arianna Pavone. Speeding Up String Matching by Weak Factor Recognition. Proceedings of the Prague Stringology Conference 2017, PSC 2017: pp. 42-50, 2017
17. Simone Faro. A Very Fast String Matching Algorithm Based on Condensed Alphabets.
18. Proceedings of the 11th International Conference on Algorithmic Aspects in Information and Management, (AAIM 2016). Lecture Notes in Computer Science Vol.9778, pp. 65- 76, 2016. doi:10.1007/978-3-319-41168-2
19. Simone Faro and M. Oguzhan Kulekci. Efficient Algorithms for the Order Preserving Pattern Matching Problem. Proceedings of the 11th International Conference on Algorithmic Aspects in Information and Management, (AAIM 2016). Lecture Notes in Computer Science Vol.9778, pp. 185-196, 2016. doi:10.1007/978-3-319-41168-2
20. Simone Faro. Evaluation and Improvement of Fast Algorithms for Exact Matching on Genome Sequences. Proceedings of the Third International Conference on Algorithms for Computational Biology (AlCoB 2016). Lecture Notes in Computer Science Vol.9702, pp. 145-157, 2016. doi:10.1007/978-3-319-38827-4
21. Dario Catalano, Mario Di Raimondo, Simone Faro. Verifiable Pattern Matching on Outsourced Texts. Proceedings of the 10th International Conference on Security and Cryptography for Networks (SCN 2016). Lecture Notes in Computer Science Vol.9841, pp. 333-350, 2016. doi:10.1007/978-3-319-44618-9
22. Simone Faro, Thierry Lecroq, Stefano Borzi, Simone Di Mauro, Alessandro Maggio. The String Matching Algorithms Research Tool. Proceedings of the Prague Stringology Conference 2016, PSC 2016, pp.99-111, isbn:978-80-01-05996-8, 2016
23. B.Adas, E.Bayraktar, S.Faro, I.E.Moustafa and M.O.Kulekci. Short Read Alignment and Compression via Shortest Unique Substring Identifiers. Proceedings of the 3rd International Work-Conference on Bioinformatics and Biomedical Engineering (IWBBIO 2015), Lecture Notes in Computer Science Vol.9044, pp. 363–374, 2015. doi:10.1007/978-3-319-16480-9 36
24. Domenico Cantone, Simone Faro, M. Oguzhan Kulekci. An Efficient Skip-Search Approach to the Order-Preserving Pattern Matching Problem. Proceedings of the Prague Stringology Conference 2015, PSC 2015, pp.22-35, isbn:978-80-01-05787-2, 2015
25. Simone Faro, Arianna Pavone. Refined Tagging of Complex Verbal Phrases for the Italian Language. Proceedings of the Prague Stringology Conference 2015, PSC 2015, pp.132-145, isbn:978-80-01-05787-2, 2015
26. Valeria Borzì, Simone Faro and Arianna Pavone. Automatic Extraction of Semantic Relations by Using Web Statistical Information. Proceedings of the International Conference on Conceptual Structures 2014 (ICCS 2014), Lecture Notes in Computer Science Vol.8577, pp.174-187, 2014. doi:10.1007/978-3-319-08389-6 15
27. Simone Faro and Domenico Cantone Efficient Online Abelian Pattern Matching in Strings by Simulating Reactive Multi-Automata Proceedings of the Prague Stringology Conference 2014, PSC 2013, pp.30-42, isbn:978-80-01-05547-2, 2014
28. Simone Faro. Swap Matching in Strings by Simulating Reactive Automata. Proceedings of the Prague Stringology Conference 2013, PSC 2013, pp. 7-20. isbn:978-80-01-05330- 0, 2013
29. Domenico Cantone, Simone Faro. Improved and Self-Tuned Occurrence Heuristics. Proceedings of the Prague Stringology Conference 2013, PSC 2013, pp. 92-106. isbn:978- 80-01-05330-0, 2013
30. Simone Faro, Oguzhan Kulekci. Towards a Very Fast Multiple String Matching Algorithm for Short Patterns Proceedings of the Prague Stringology Conference 2013, PSC 2013, pp. 78-91. isbn:978-80-01-05330-0, 2013
31. Simone Faro, Oguzhan Kulekci. Fast Packed String Matching for Short Patterns.
32. Proceedings of the 15th Meeting on Algorithm Engineering and Experiments, ALENEX 2013, SIAM, pp. 113-121, 2013.
33. Simone Faro, Thierry Lecroq. Fast Searching in Biological Sequences Using Multiple Hash Functions. Proceedings of 12th IEEE International Conference on BioInformatics and BioEngineering, BIBE 212, IEEE Computer Society, pp. 175-180, 2012. doi:10.1109/BIBE.2012.6399669
34. Simone Faro, Oguzhan Kulekci. Fast Multiple String Matching Using Streaming SIMD Extensions Technology. Proceedings of 19th International Symposium on String Processing and Information Retrieval, SPIRE 2012, Lecture Notes in Computer Science, Vol.7608, pp.217-228, isbn:978-3-642-34108-3, 2012. doi:10.1007/978-3-642-34109-0
35. Simone Faro, Thierry Lecroq. A Fast Suffix Automata Based Algorithm for Exact Online String Matching. Proceedings of 17th International Conference on Implementation and Application of Automata, CIAA 212, Lecture Notes in Computer Science, Vol.7381/2012, pp.149-158, isbn:978-3-642-31605-0, 2012. doi:10.1007/978-3-642-31606-7
36. Simone Faro, Thierry Lecroq. A Multiple Sliding Windows Approach to Speed Up String Matching Algorithms. Proceedings of 11th International Symposium on Experimental Algorithms, SEA 2012, Lecture Notes in Computer Science, Vol.7276/2012, pp.172-183, isbn:978-3-642-30849-9, 2012. doi:10.1007/978-3-642-30850-5
37. Simone Faro and Thierry Lecroq. 2001-2010: Ten Years of Exact String Matching Algorithms. Proceedings of the Algorithmique, combinatoire du texte et applications en bio-informatique, SeqBio 2011, invited talk, 2011
38. Simone Faro and Thierry Lecroq. 2001-2010: Ten Years of Exact String Matching Algorithms. Proceedings of the Prague Stringology Conference 2011, PSC 2011, invited talk, pp. 1-2. isbn:978-80-01-04870-2, 2011
39. Domenico Cantone, Salvatore Cristofaro and Simone Faro. 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, Vol. 6661/2011, pp. 364-375, isbn:978-3-642-21457-8, 2011. doi:10.1007/978-3-642-21458-5
40. Domenico Cantone, Simone Faro and Emanuele Giaquinta. Approximate String Matching Allowing for Inversions and Translocations In Proceedings of the Prague Stringology Conference 2010, PSC 2010, pp. 37-51, isbn:978-80-01-04597-8, 2010.
41. Domenico Cantone and Simone Faro. A Space-Efficient Implementation of the Good- Suffix Heuristic. In Proceedings of the Prague Stringology Conference 2010, PSC 2010, pp. 63-75, isbn:978-80-01-04597-8, 2010.
42. Domenico Cantone, Simone Faro and Emanuele Giaquinta. 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, Vol.6129/2010, pp.288-298, isbn:978-3-642-13508-8, 2010. doi:10.1007/978-3-642-13509-5 26
43. Domenico Cantone, Simone Faro and Emanuele Giaquinta. Bit-(Parallelism)2: Getting to the Next Level of Parallelism. In Proc. of the Fifth International Conference on Fun With Algorithms, FUN 2010, Lecture Notes in Computer Science, Vol. 6099/2010, pp.166-177, isbn:978-3-642-13121-9, 2010. doi:10.1007/978-3-642-13122-6 18
44. Simone Faro and Elisa Pappalardo. Ant-CSP: an Ant Colony Optimization Algorithm for the Closest String Problem. In Proc. of the 36th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2010, Lecture Notes in Computer Science, Vol.5901, pp.370-381, isbn:978-3-642-11265-2, 2010. doi:10.1007/978-3-642-11266-9 31
45. 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. Lecture Notes In Computer Science, Vol. 5404, pp.255-266, isbn: 978-3-540-95890-1, 2009. doi:10.1007/978-3-540-95891-8 25
46. 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, pp.106-115, isbn:978-3-642-02440-5, 2009. doi:10.1007/978-3-642-02441-2 10
47. 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, pp.230-241, isbn:978-3-642-10216-5, 2009. doi:10.1007/978-3-642-10217-2 24
48. Matteo Campanelli, Domenico Cantone, Simone Faro and Emanuele Giaquinta. An Efficient Algorithm for Approximate Pattern Matching with Swaps. In Proceedings of the 14th Prague Stringology Conference, PSC 2009, pp. 90-104 isbn:978-80-01-04403-2, 2009.
49. Domenico Cantone, Simone Faro and Emanuele Giaquinta. Adapting Boyer-Moore-Like Algorithms for Searching Huffman Encoded Texts. In Proceedings of the 14th Prague Stringology Conference, PSC 2009, pp. 29-39, isbn:978-80-01-04403-2, 2009.
50. Simone Faro and Thierry Lecroq. Efficient Variants of the Backward-Oracle-Matching Algorithm. In Proceedings of the 13th Prague Stringology Conference, PSC 2008, pp. 146-160, isbn:978-80-01-04145-1, 2008.
51. Domenico Cantone, Salvatore Cristofaro and Simone Faro. New Efficient Bit-Parallel Algorithms for the Delta-Matching Problem with Alpha-Bounded Gaps. In Proceedings of the 13th Prague Stringology Conference, PSC 2008, pp. 170-184 isbn:978-80-01-04145-1, 2008.
52. Domenico Cantone, Salvatore Cristofaro, Simone Faro and 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, isbn:978-1-58603-975-2, 2008. doi:10.3233/978-1-58603-975-2-175
53. Domenico Cantone and Simone Faro. Pattern Matching for Control Chart Monitoring. Progress in Industrial Mathematics at ECMI 2006, Mathematics in Industry, Springer Verlag, Vol. 12, III, pp. 918-922, isbn:978-3-540-71992-2, 2008. doi:10.1007/978-3-540-71992-2 161
54. Domenico Cantone, Salvatore Cristofaro and Simone Faro. On some Combinatorial Problems concerning the Harmonic Structure of Musical Chord Sequences. In Proc. of the 12th Prague Stringology Conference, PSC 2006, pp. 49-64. isbn:80-01-03533-6, 2006.
55. Domenico Cantone, Salvatore Cristofaro and Simone Faro. An Efficient Algorithm for delta-Approximate-Matching with alpha-Bounded Gaps in Musical Sequences. In Proceedings of 4th International Workshop on Experimental and Efficient Algorithms. WEA 2005. Lecture Notes in Computer Science, Vol. 3503, pp. 428-439 isbn:3-540-25920-1, 2005. doi:10.1007/11427186 37
56. Domenico Cantone and Simone Faro. A Space Efficient Bit-Parallel Algorithm for the Multiple String Matching Problem. In Proceedings of the Prague Stringology Conference ’05, PSC 2005, Czech Technical University, Prague, pp. 109-124 isbn:isbn:80-01-03307-4, 2005.
57. Domenico Cantone and Simone Faro. Searching for a substring with constant extra space complexity. In Proceedings of the Third International Conference on FUN with Algorithms, FUN 2004, Edizioni Plus, University of Pisa, pp. 118-131, 2004.
58. 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, pp. 75-80, 2004.
59. Domenico Cantone, Salvatore Cristofaro and Simone Faro. Efficient Algorithms for the delta-Approximate String Matching Problem in Musical Sequences. In Proceedings of the Prague Stringology Conference ’04, Czech Technical University, Prague, pp. 33-47, isbn:isbn:80-01-03050-4, 2004.
60. Domenico Cantone and Simone Faro. Fast-Search: a New Efficient Variant of the Boyer- Moore String Matching Algorithm. In Proceedings of Second International Workshop on Experimental Algorithms, WEA 2003, Lecture Notes in Computer Science, Springer, Vol. 2647, pp. 47-58, isbn:3-540-40205-5, 2003.
61. doi:10.1007/3-540-44867-5 4
62. Domenico Cantone and Simone Faro. Forward-Fast-Search: Another Fast Variant of the Boyer-Moore String Matching Algorithm. In Proceedings of the Prague Stringology Conference ’03, PSC 2003, Czech Technical University, Prague, pp. 10-24, 2003.
63. Domenico Cantone and Simone Faro. On the Frequency of Characters in Natural Language Texts. In Proceedings of Algebraic Methods in Language Processing 2003, II AMAST Workshop On Language Processing, pp. 69-82, 2003.

Interessi di ricerca:

• Text and strings processing algorithms
• Simulation of nondeterministic finite automata
• Exact and approximate pattern matching
• Multiple string matching
• Data compression
• Pattern matching on compressed texts
• Combinatorial algorithms on graphs
• Privacy preserving text processing

Partecipazione a convegni internazionali:

Tutte le informazioni relative all'esame di Abilità Informatiche (Dipartimento di Scienze Umanistiche) possono essere reperite sul sito internt del corso, all'indirizzo: https://www.dmi.unict.it/~faro/infdisum/esami/abinform.php

Le risposte alle domande frquenti relative all'esame di Abilità Informatiche possono essere trovate all'indirizzo web: https://www.dmi.unict.it/~faro/infdisum/esami/faq.php