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.
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… 
Highly Cited
2009
Highly Cited
2009
An experimental investigation of set intersection algorithms for text searching
The intersection of large ordered sets is a common problem in the context of the evaluation of boolean queries to a search engine… 
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… 
Highly Cited
2006
Highly Cited
2006
Spam Filtering Using Inexact String Matching in Explicit Feature Space with On-Line Linear Classifiers
Contemporary spammers commonly seek to defeat statistical spam filters through the use of word obfuscation. Such methods include… 
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
1995
Highly Cited
1995
Envision: a user-centered database of computer science literature
Project Envision is an early NSF-funded digital library effort to develop a multimedia collection of computer science literature… 
Highly Cited
1995
Highly Cited
1995
Matching a Set of Strings with Variable Length don't Cares
Highly Cited
1980
Highly Cited
1980
How to describe pure form and how to measure differences in shapes using shape numbers
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)