Name
Abstract | ||
|---|---|---|
Unique, gene-specific oligonucleotides are used for many genetic investigations such as polymerase chain reaction, gene cloning, microarray technology and antisense DNA studies. It is a computationally demanding task to extract these oligonucleotides from DNA databases. We studied the problem from the point of view of the string matching problem. We implemented and tested several exact string matching algorithms and modified the implementations to be as effective as possible. Ten different implementations were tested on yeast genomic sequence data. The run times for the best algorithms were significantly improved compared to conventional approaches, while in principle, i.e. in respect of theoretical time complexity, these algorithms do not actually differ essentially from each other. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1016/j.compbiomed.2003.11.003 | Computers in Biology and Medicine |
Keywords | DocType | Volume |
Exact string matching,Keyword tree (trie),Genomic data sequences,DNA sequences,Oligonucleotides | Journal | 35 |
Issue | ISSN | Citations |
2 | 0010-4825 | 3 |
PageRank | References | Authors |
0.52 | 5 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Heikki Hyyrö | 1 | 143 | 15.04 |
| Martti Juhola | 2 | 456 | 63.94 |
| Mauno Vihinen | 3 | 145 | 26.73 |