New Heuristics and exact algorithms for the planted DNA (l, d)-Motif finding problem

Author

NABOS JULIETA

Date of Award

2016

Document Type

Dissertation

Degree Name

Doctor of Philosophy in Computer Science

Department

Information Systems & Computer Science

First Advisor

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

Abstract

This study explored some approaches that can improve algorithms for finding (l,d)-motifs in DNA sequences. Two new exact algorithms, EMS-PG and EMS-GT that employ pattern-based approach and instance-based approach, respectively, were developed. Number map

Comments

The C7.N34 2016

Recommended Citation

JULIETA, NABOS, (2016). New Heuristics and exact algorithms for the planted DNA (l, d)-Motif finding problem. Archīum.ATENEO.
https://archium.ateneo.edu/theses-dissertations/335