String searching algorithm

Known as: String search algorithm, Text searching, Search string 
In computer science, string searching algorithms, sometimes called string matching algorithms, are an important class of string algorithms that try… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
In the execution of method invocation sequences to test component security, abnormal or normal information is generated and… (More)
  • table I
  • table II
  • table III
  • table IV
  • table 5
Is this relevant?
2013
2013
How does the computer find strings when the user searches for them? How is it possible to find several hundred thousands results… (More)
  • figure 1
  • figure 2
Is this relevant?
2010
2010
Exact string Searching is one of the most important problems that had been investigated by many studies ranging from finding the… (More)
  • table 1
Is this relevant?
2010
2010
This paper consists of implementation of the eleven algorithms in two different cluster architecture environments. Static pattern… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Intrusion detection systems (IDSs) have become widely recognized as powerful tools for identifying, deterring and deflecting… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 7
Is this relevant?
Highly Cited
1998
Highly Cited
1998
The approximate string matching problem is to find all locations at which a query of length<italic>m</italic> matches a substring… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1992
Highly Cited
1992
In the string-searching problem we have a pattern pat, of length m, all occurrences of which are to be found in a text string… (More)
  • figure I
Is this relevant?
Highly Cited
1991
Highly Cited
1991
Since the Boyer-Moore algorithm was described in 1977, it has been the standard benchmark for the practical string search… (More)
  • figure 1
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1989
Highly Cited
1989
We introduce a family of simple and fast algorithms for solving the classical string matching problem, string matching with don't… (More)
  • table 1
  • table 2
  • figure 1
Is this relevant?
Highly Cited
1977
Highly Cited
1977
An algorithm is presented that searches for the location, “<italic>i</italic>l” of the first occurrence of a character string… (More)
  • figure 2
  • figure 4
Is this relevant?