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

Mata-Montero, Manrique and Shalaby, Nabil and Sheppard, Bradley (2013) Efficient Serial and Parallel Algorithms for Selection of Unique Oligos in EST Databases. Advances in Bioinformatics, 2013. ISSN 1687-8035

[img] [English] PDF (Migrated (PDF/A Conversion) from original format: (application/pdf)) - Published Version
Available under License Creative Commons Attribution Non-commercial.

Download (1MB)


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 algorithmwas 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 oligosmuch 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.

Item Type: Article
URI: http://research.library.mun.ca/id/eprint/1900
Item ID: 1900
Additional Information: Memorial University Open Access Author's Fund
Department(s): Science, Faculty of > Computer Science
Date: 14 February 2013
Date Type: Publication
Related URLs:

Actions (login required)

View Item View Item


Downloads per month over the past year

View more statistics