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
id ph-ateneo-arc.theses-dissertations-1461
record_format eprints
spelling ph-ateneo-arc.theses-dissertations-14612021-04-20T03:07:45Z New Heuristics and exact algorithms for the planted DNA (l, d)-Motif finding problem JULIETA, NABOS 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 2016-01-01T08:00:00Z text https://archium.ateneo.edu/theses-dissertations/335 http://rizalls.lib.admu.edu.ph/#section=resource&resourceid=975507539&currentIndex=0&view=fullDetailsDetailsTab Theses and Dissertations (All) Archīum Ateneo Bioinformatics Genetics -- Data processing Nucleotide sequence -- Data processing Computational biology -- Methods Heuristic algorithms Sequence analysis -- 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 Bioinformatics
Genetics -- Data processing
Nucleotide sequence -- Data processing
Computational biology -- Methods
Heuristic algorithms
Sequence analysis -- Methods
spellingShingle Bioinformatics
Genetics -- Data processing
Nucleotide sequence -- Data processing
Computational biology -- Methods
Heuristic algorithms
Sequence analysis -- Methods
JULIETA, NABOS
New Heuristics and exact algorithms for the planted DNA (l, d)-Motif finding problem
description 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
format text
author JULIETA, NABOS
author_facet JULIETA, NABOS
author_sort JULIETA, NABOS
title New Heuristics and exact algorithms for the planted DNA (l, d)-Motif finding problem
title_short New Heuristics and exact algorithms for the planted DNA (l, d)-Motif finding problem
title_full New Heuristics and exact algorithms for the planted DNA (l, d)-Motif finding problem
title_fullStr New Heuristics and exact algorithms for the planted DNA (l, d)-Motif finding problem
title_full_unstemmed New Heuristics and exact algorithms for the planted DNA (l, d)-Motif finding problem
title_sort new heuristics and exact algorithms for the planted dna (l, d)-motif finding problem
publisher Archīum Ateneo
publishDate 2016
url https://archium.ateneo.edu/theses-dissertations/335
http://rizalls.lib.admu.edu.ph/#section=resource&resourceid=975507539&currentIndex=0&view=fullDetailsDetailsTab
_version_ 1712577833295937536

Similar Items