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 |
id |
ph-ateneo-arc.theses-dissertations-1424 |
---|---|
record_format |
eprints |
spelling |
ph-ateneo-arc.theses-dissertations-14242021-04-11T05:42:03Z Improving an exact solution to the (l,d)-Planted motif problem using a pattern-based speedup technique MARIA CLARA ISABEL, SIA 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 2015-01-01T08:00:00Z text https://archium.ateneo.edu/theses-dissertations/298 Theses and Dissertations (All) Archīum Ateneo Genetics -- Data processing DNA -- Structure -- Computer simulation Molecular biology -- Mathematical models Nucleotide sequence -- Statistical methods -- Computer simulation Computational biology -- Methods |
institution |
Ateneo De Manila University |
building |
Ateneo De Manila University Library |
continent |
Asia |
country |
Philippines Philippines |
content_provider |
Ateneo De Manila University Library |
collection |
archium.Ateneo Institutional Repository |
topic |
Genetics -- Data processing DNA -- Structure -- Computer simulation Molecular biology -- Mathematical models Nucleotide sequence -- Statistical methods -- Computer simulation Computational biology -- Methods |
spellingShingle |
Genetics -- Data processing DNA -- Structure -- Computer simulation Molecular biology -- Mathematical models Nucleotide sequence -- Statistical methods -- Computer simulation Computational biology -- Methods MARIA CLARA ISABEL, SIA Improving an exact solution to the (l,d)-Planted motif problem using a pattern-based speedup technique |
description |
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 |
format |
text |
author |
MARIA CLARA ISABEL, SIA |
author_facet |
MARIA CLARA ISABEL, SIA |
author_sort |
MARIA CLARA ISABEL, SIA |
title |
Improving an exact solution to the (l,d)-Planted motif problem using a pattern-based speedup technique |
title_short |
Improving an exact solution to the (l,d)-Planted motif problem using a pattern-based speedup technique |
title_full |
Improving an exact solution to the (l,d)-Planted motif problem using a pattern-based speedup technique |
title_fullStr |
Improving an exact solution to the (l,d)-Planted motif problem using a pattern-based speedup technique |
title_full_unstemmed |
Improving an exact solution to the (l,d)-Planted motif problem using a pattern-based speedup technique |
title_sort |
improving an exact solution to the (l,d)-planted motif problem using a pattern-based speedup technique |
publisher |
Archīum Ateneo |
publishDate |
2015 |
url |
https://archium.ateneo.edu/theses-dissertations/298 |
_version_ |
1712577826555691008 |