efficient serial and parallel algorithms for selection of unique oligos in est databases

Clicks: 155
ID: 199527
2013
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This article has not been analysed, so there is no overall score — reader engagement is measured and shown alongside.
AI Quality Assessment
Not analyzed
Readership in this journal
Popular

Ranked #177 of 194 articles by views in journal of hepatocellular carcinoma

Most read Least read

Bar heights use a square-root scale. Only the 120 most-read articles are drawn; the journal has 194 in total.

Mint this article as an NFT
Not yet minted

Create a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.

5 SUSD one-off · no wallet required
Abstract
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.
Reference Key
mata-montero2013advancesefficient Use this key to autocite in the manuscript while using SciMatic Manuscript Manager or Thesis Manager
Authors ;Manrique Mata-Montero;Nabil Shalaby;Bradley Sheppard
Journal journal of hepatocellular carcinoma
Year 2013
DOI
10.1155/2013/793130
URL
Keywords

Citations

No citations found. To add a citation, contact the admin at info@scimatic.org

No comments yet. Be the first to comment on this article.