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

Abstract EN

Obtaining unique oligos from an EST database is a problem of great importance in bioinformatics, particularly in the discovery of new genes and the mapping of the human genome.

Many algorithms have been developed to find unique oligos, many of which are much less time consuming than the traditional brute force approach.

An algorithm was presented by Zheng et al.

(2004) which finds the solution of the unique oligos search problem efficiently.

We implement this algorithm as well as several new algorithms based on some theorems included in this paper.

We demonstrate how, with these new algorithms, we can obtain unique oligos much faster than with previous ones.

We parallelize these new algorithms to further improve the time of finding unique oligos.

All algorithms are run on ESTs obtained from a Barley EST database.