Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

34 relations
Aho–Corasick algorithmAlgorithmApostolico–Giancarlo algorithmApproximate string matching

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
WHAM: A High-Throughput Sequence Alignment Method
Over the last decade, the cost of producing genomic sequences has dropped dramatically due to the current so-called next… 
2010
2010
Relevance ranking in georeferenced video search
The rapid adoption and deployment of ubiquitous video cameras has led to the collection of voluminous amounts of media data… 
2008
2008
Content Assessment in Intelligent Computer-aided Language Learning: Meaning Error Diagnosis for English as a Second Language
Language practice that includes meaningful interaction is a critical component of many current language teaching theories. At the… 
2007
2007
An Improved String Searching Algorithm
It is by improving the efficiency of string searching that can enhance the efficiency of intrusion detection. On studying Boyer… 
2005
2005
A Fast Approximate String Searching Algorithm
In both approximate and exact string searching algorithms, the shift distance at the skipping step plays a major role in the… 
Highly Cited
2004
Highly Cited
2004
Performance analysis of content matching intrusion detection systems
Although network intrusion detection systems (nIDS) are widely used, there is limited understanding of how these systems perform… 
Highly Cited
1993
Highly Cited
1993
The Splash 2 processor and applications
Splash 2 is an attached parallel processor in which the computing elements are user-programmable FPGA devices. The architecture… 
1990
1990
An Analysis of the Karp-Rabin String Matching Algorithm
1989
1989
Model-Guided Attributed String Matching by Split-and-Merge for Shape Recognition
Due to noise and distortion, segmentation uncertainty is a key problem in structural pattern analysis. In this paper we propose… 
Highly Cited
1982
Highly Cited
1982
Citing statements: Computer recognition and use to improve retrieval
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)