To be filled out by faculty nominator, can be edited by student:

An Appromximation Algorithm for Motif Finding in DNA Sequences

Faculty Mentor

Dr. Elise DeDoncker

Department

Computer Science

Presentation Date

4-13-2017

Document Type

Poster

Abstract

• Motif finding is a significant problem in biology and computer science fields.

• Search for similar (not exact) motifs in multiple DNA sequences is non -trivial, and is a time trivial, and is a time -consuming problem.

• IDEA: design an algorithm that reduces the search space to decrease the run -time based on a d-neighbors set analysis.

• The d -neighbors set is a list of all instances for subsequence x of length I with maximum allowed mutations ≤ d.

• Analyzing these sets to make use of the distance frequencies between neighbors without generating them would help to build the proposed algorithm and make it faster.

Available for download on Tuesday, April 17, 2018

Share

COinS