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

• المؤلف الرئيسي: JULIETA, NABOS
• التنسيق: text
• منشور في: Archīum Ateneo 2016
• الموضوعات: Bioinformatics; Genetics > Data processing; Nucleotide sequence > Data processing; Computational biology > Methods; Heuristic algorithms; Sequence analysis > Methods
• الوصول للمادة أونلاين: https://archium.ateneo.edu/theses-dissertations/335; http://rizalls.lib.admu.edu.ph/#section=resource&resourceid=975507539&currentIndex=0&view=fullDetailsDetailsTab

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