[PDF][PDF] The String Matching Algorithms Research Tool.
String matching is the problem of finding all occurrences of a given pattern in a given text. It
is an extensively studied problem in computer science because of its direct application to …
is an extensively studied problem in computer science because of its direct application to …
A weak approach to suffix automata simulation for exact and approximate string matching
S Faro, S Scafiti - Theoretical Computer Science, 2022 - Elsevier
String matching is one of the most extensively studied problems in computer science, mainly
due to its direct applications to such diverse areas as text, image and signal processing …
due to its direct applications to such diverse areas as text, image and signal processing …
Hybrid string matching algorithm with a pivot
AM Al-Ssulami - Journal of Information Science, 2015 - journals.sagepub.com
Pattern matching is important in text processing, molecular biology, operating systems and
web search engines. Many algorithms have been developed to search for a specific pattern …
web search engines. Many algorithms have been developed to search for a specific pattern …
Bit-parallel algorithms for exact circular string matching
KH Chen, GS Huang, RCT Lee - The Computer Journal, 2014 - ieeexplore.ieee.org
In this paper, we deal with the exact circular string matching problem (abbreviated as
ECSM). Given a string P= p 1 p 2⋯ pm, a string P (i)= pip i+ 1⋯ pmp 1⋯ pi− 1, for 1≤ i≤ m …
ECSM). Given a string P= p 1 p 2⋯ pm, a string P (i)= pip i+ 1⋯ pmp 1⋯ pi− 1, for 1≤ i≤ m …
Linear and efficient string matching algorithms based on weak factor recognition
We present a simple and very efficient algorithm for string matching based on the
combination of weak factor recognition and hashing. Despite its quadratic worst-case …
combination of weak factor recognition and hashing. Despite its quadratic worst-case …
A very fast string matching algorithm based on condensed alphabets
S Faro - Algorithmic Aspects in Information and Management …, 2016 - Springer
String matching is the problem of finding all the substrings of a text which correspond to a
given pattern. It's one of the most investigated problem in computer science, mainly due to its …
given pattern. It's one of the most investigated problem in computer science, mainly due to its …
Compact suffix automata representations for searching long patterns
S Faro, S Scafiti - Theoretical Computer Science, 2023 - Elsevier
Abstract Automata based algorithms have always dominated the history of string matching,
thanks to their intrinsic nature of recognizers. Among them, those based on the suffix …
thanks to their intrinsic nature of recognizers. Among them, those based on the suffix …
The range automaton: An efficient approach to text-searching
S Faro, S Scafiti - … on Words: 13th International Conference, WORDS …, 2021 - Springer
String matching is one of the most extensively studied problems in computer science, mainly
due to its direct applications to such diverse areas as text, image and signal processing …
due to its direct applications to such diverse areas as text, image and signal processing …
Speeding up string matching by weak factor recognition
String matching is the problem of finding all the substrings of a text which match a given
pattern. It is one of the most investigated problems in computer science, mainly due to its …
pattern. It is one of the most investigated problems in computer science, mainly due to its …
Evaluation and improvement of fast algorithms for exact matching on genome sequences
S Faro - … Biology: Third International Conference, AlCoB 2016 …, 2016 - Springer
With the availability of large amounts of dna data, exact matching of nucleotide sequences
has become an important application in modern computational biology and in meta …
has become an important application in modern computational biology and in meta …