Improving an exact solution to the (l,d)-Planted motif problem using a pattern-based speedup technique

Date of Award

2015

Document Type

Thesis

Degree Name

Master of Science in Computer Science, Straight

Department

Information Systems & Computer Science

First Advisor

Fernandez, Proceso L., Jr., Ph.D.

Abstract

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

Comments

The C7.S53 2015

This document is currently not available here.

Share

COinS