Skip to main content
Figure 2 | BMC Bioinformatics

Figure 2

From: Refined repetitive sequence searches utilizing a fast hash function and cross species information retrievals

Figure 2

Database search pseudo code. The length of the query sequence Q determines which block of code will execute. Lines 3 – 18 execute for |Q| <k (wordsize) while lines 19 – 29 execute for |Q| = k. If k < |Q| < 2k then Q is divided into two k length pieces for recursive calls to Search in lines 32 – 35 and the results from these calls are further tested in lines 38 – 41 to obtain the final answer in line 42. If |Q| > = 2k, a similar block of code is executed in lines 44 – 57. However, a different comparison is made in line 54 as compared to line 40.

Back to article page