Scribd
Upload
31 views10 pages

String Matching Algorithms

The document discusses string matching algorithms, which find patterns in text. It describes exact and approximate string matching. Applications include plagiarism detection and bioinformatics. The naive algorithm is presented, which compares characters sequentially with complexity O(nm).

Uploaded by

Sanju Malik
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
31 views10 pages

String Matching Algorithms

The document discusses string matching algorithms, which find patterns in text. It describes exact and approximate string matching. Applications include plagiarism detection and bioinformatics. The naive algorithm is presented, which compares characters sequentially with complexity O(nm).

Uploaded by

Sanju Malik
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 10

String Matching Algorithms

• String matching operation is a core part in many text processing


applications. The objective of this algorithm is to find pattern P from
given text T. Typically |P|<< |T|. In the design of compilers and text
editors, string matching operation is crucial. So locating P in T
efficiently is very important.
• The problem is defined as follows: “Given some text string T[1….n] of
size n, find all occurrences of pattern P[1…m] of size m in T.”
String Matching Algorithms can broadly be classified into two types of
algorithms –
• Exact String Matching Algorithms
• Approximate String Matching Algorithms
Exact String Matching Algorithms:
Exact string matching algorithms is to find one, several, or all occurrences of
a defined string (pattern) in a large string (text or sequences) such that each
matching is perfect. All alphabets of patterns must be matched to
corresponding matched subsequence.
Approximate String Matching Algorithms:
Approximate String Matching Algorithms (also known as Fuzzy String
Searching) searches for substrings of the input string.
Applications of String Matching Algorithms:
• Plagiarism Detection
• Bioinformatics and DNA Sequencing
• Digital Forensics
• Spelling Checker
• Spam filters
• Search engines or content search in large databases
Naive String Matching Algorithm
• This is simple and efficient brute force approach. It compares the first
character of pattern with searchable text. If a match is found, pointers in
both strings are advanced. If a match is not found, the pointer to text is
incremented and pointer of the pattern is reset. This process is repeated till
the end of the text.
• The naïve approach does not require any pre-processing. Given text T and
pattern P, it directly starts comparing both strings character by character.
• After each comparison, it shifts pattern string one position to the right.
• Following example illustrates the working of naïve string matching
algorithm. Here,
T = PLANINGANDANALYASIS and P = AND
• Here, ti and pj are indices of text and pattern respectively.
Algorithm
• Algorithm NAÏVE_STRING_MATCHING(T, P)
• // T is the text string of length n
• // P is the pattern of length m

• for i ← 0 to n – m do
• if P[1… m] == T[i+1…i+m] them
• print “Match Found”
• end
• End

• Complexity = O(n*m)

You might also like