An Improved Hashing Approach for Biological Sequence to Solve Exact Pattern Matching Problems

Algorithm 1

Pre-processing of HAPM (P).

(1)	//preprocess only pattern characters and take any prime number
(2)	q ⟵ prime number
(3)	for (i = 0 to m) do
(4)	sum ⟵ ASCII (pi)
(5)	end for loop
(6)	//Generate hash value
(7)	h (p) ⟵ sum mod q
(8)	//Generate quotient value using predefined prime number
(9)	r (p) ⟵ sum divide q
(10)	//Generate QS table for the pattern
(11)	set <char> alphabet set, map < char, int > QsBc
(12)	set <char>:: iterator i
(13)	for (i = alphabet_set.begin() to i! = alphabet_set.end()) do
(14)	QsBc[i] ⟵ m + 1
(15)	end for loop
(16)	for (i = 0 to pattern size) do
(17)	QsBc [pattern[i]] ⟵ m – i
(18)	end for loop
(19)	Searching (t, p)