Improving an exact solution to the (l,d)-Planted motif problem using a pattern-based speedup technique
DNA motif finding is widely recognized as a difficult problem in computational biology and computer science. Because of the usual large search space involved, exact solutions typically require a significant amount of execution time before discovering a mo
Saved in:
| Main Author: | |
|---|---|
| Format: | text |
| Published: |
Archīum Ateneo
2015
|
| Subjects: | |
| Online Access: | https://archium.ateneo.edu/theses-dissertations/298 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Ateneo De Manila University |