Research Article
Efficient Serial and Parallel Algorithms for Selection of Unique Oligos in EST Databases
(1) posi a list of positions of qmer in D | ( where corresponds to position of sequence ) | (2) for to length() do | (3) for to length() do | (4) if then | (5) list of -mers generated from the extension of the in position | (6) list of -mers generated from the extension of the in position | (7) for to length() do | (8) for to length() do | (9) if then | (10) mark the as non-unique | (11) end if | (12) end for | (13) end for | (14) end if | (15) end for | (16) end for |
|