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

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

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

Saved in:
Bibliographic Details
Main Author: JULIETA, NABOS
Format: text
Published: Archīum Ateneo 2016
Subjects:
Bioinformatics
Genetics > Data processing
Nucleotide sequence > Data processing
Computational biology > Methods
Heuristic algorithms
Sequence analysis > Methods
Online Access:https://archium.ateneo.edu/theses-dissertations/335
http://rizalls.lib.admu.edu.ph/#section=resource&resourceid=975507539&currentIndex=0&view=fullDetailsDetailsTab
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Ateneo De Manila University
Description
Summary: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

Similar Items