受强制性开放获取政策约束的文章 - Simone Faro了解详情
无法在其他位置公开访问的文章：4 篇
A weak approach to suffix automata simulation for exact and approximate string matching
S Faro, S Scafiti
Theoretical Computer Science 933, 88-103, 2022
强制性开放获取政策： Government of Italy
On the longest common Cartesian substring problem
S Faro, T Lecroq, K Park, S Scafiti
The Computer Journal 66 (4), 907-923, 2023
强制性开放获取政策： UK Engineering and Physical Sciences Research Council, Government of Italy
Efficient string matching based on a two-step simulation of the suffix automaton
S Faro, S Scafiti
International Conference on Implementation and Application of Automata, 165-177, 2021
强制性开放获取政策： Government of Italy
Compact suffix automata representations for searching long patterns
S Faro, S Scafiti
Theoretical Computer Science 940, 254-268, 2023
强制性开放获取政策： Government of Italy
可在其他位置公开访问的文章：4 篇
A very fast string matching algorithm based on condensed alphabets
S Faro
Algorithmic Aspects in Information and Management: 11th International …, 2016
强制性开放获取政策： Government of Italy
Linear and efficient string matching algorithms based on weak factor recognition
D Cantone, S Faro, A Pavone
Journal of Experimental Algorithmics (JEA) 24, 1-20, 2019
强制性开放获取政策： Government of Italy
Evaluation and improvement of fast algorithms for exact matching on genome sequences
S Faro
Algorithms for Computational Biology: Third International Conference, AlCoB …, 2016
强制性开放获取政策： Government of Italy
Automatic extraction of semantic relations by using web statistical information
V Borzì, S Faro, A Pavone
Graph-Based Representation and Reasoning: 21st International Conference on …, 2014
强制性开放获取政策： Government of Italy
出版信息和资助信息由计算机程序自动确定