Scribd
Upload
26 views

KMP String Matching

This document summarizes the KMP string matching algorithm. It includes a Java class with methods to compute the longest prefix suffix array and perform the KMP search. The KMPSearch method finds all occurrences of the pattern in the text by iterating through them with indices i and j while matching characters and updating j based on the lps array. The computeLPSArray method calculates the lps array by iterating through the pattern and extending the length of matching prefixes.

Uploaded by

21cse120 tankalareshma
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
26 views

KMP String Matching

This document summarizes the KMP string matching algorithm. It includes a Java class with methods to compute the longest prefix suffix array and perform the KMP search. The KMPSearch method finds all occurrences of the pattern in the text by iterating through them with indices i and j while matching characters and updating j based on the lps array. The computeLPSArray method calculates the lps array by iterating through the pattern and extending the length of matching prefixes.

Uploaded by

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

// JAVA program for implementation of KMP pattern

// searching algorithm

class KMP_String_Matching {

void KMPSearch(String pat, String txt)

int M = pat.length();

int N = txt.length();

// create lps[] that will hold the longest

// prefix suffix values for pattern

int lps[] = new int[M];

int j = 0; // index for pat[]

// Preprocess the pattern (calculate lps[]

// array)

computeLPSArray(pat, M, lps);

int i = 0; // index for txt[]

while ((N - i) >= (M - j)) {

if (pat.charAt(j) == txt.charAt(i)) {

j++;

i++;

if (j == M) {

System.out.println("Found pattern "

+ "at index " + (i - j));

j = lps[j - 1];

// mismatch after j matches


else if (i < N

&& pat.charAt(j) != txt.charAt(i)) {

// Do not match lps[0..lps[j-1]] characters,

// they will match anyway

if (j != 0)

j = lps[j - 1];

else

i = i + 1;

void computeLPSArray(String pat, int M, int lps[])

// length of the previous longest prefix suffix

int len = 0;

int i = 1;

lps[0] = 0; // lps[0] is always 0

// the loop calculates lps[i] for i = 1 to M-1

while (i < M) {

if (pat.charAt(i) == pat.charAt(len)) {

len++;

lps[i] = len;

i++;

else // (pat[i] != pat[len])

// This is tricky. Consider the example.

// AAACAAAA and i = 7. The idea is similar

// to search step.
if (len != 0) {

len = lps[len - 1];

// Also, note that we do not increment

// i here

else // if (len == 0)

lps[i] = len;

i++;

// Driver code

public static void main(String args[])

String txt = "ABABDABACDABABCABAB";

String pat = "ABABCABAB";

new KMP_String_Matching().KMPSearch(pat, txt);

// This code has been contributed by Amit Khandelwal.

You might also like