Efficient Serial and Parallel Algorithms for Selection of Unique Oligos in EST Databases

Table 1

Results of serial algorithms.

Algorithm	𝑙	𝑑	𝑞	Dataset	Time taken (secs)	Non-unique oligos
Algorithm 2	28	6	4	1 (78 ESTs)	163	46,469
Algorithm 1	28	6	7	1 (78 ESTs)	131	46,469
Algorithm 3	27	6	9	1 (78 ESTs)	231	46,564
Algorithm 2	28	6	4	2 (2838 ESTs)	197, 500	1,611,241
Algorithm 1	28	6	7	2 (2838 ESTs)	117, 714	1,611,241
Algorithm 3	27	6	9	2 (2838 ESTs)	94, 317	1,614,235