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

Table 2

Results of parallel algorithms on 12 processors.

Algorithm	𝑙	𝑑	𝑞	Dataset	Time taken (secs)	Non-unique oligos
Algorithm 2	28	6	4	1 (78 ESTs)	33	46,469
Algorithm 1	28	6	7	1 (78 ESTs)	29	46,469
Algorithm 3	27	6	9	1 (78 ESTs)	66	46,564
Algorithm 2	28	6	4	2 (2838 ESTs)	40, 420	1,611,241
Algorithm 1	28	6	7	2 (2838 ESTs)	22, 848	1,611,241
Algorithm 1	27	6	9	2 (2838 ESTs)	18, 375	1,614,235