An efficient algorithm to identify DNA motifs

DOI10.1007/S11786-013-0165-6MaRDI QIDQ2254087zbMATH OpenOpenAlexFDO

Authors Mostafa M. Abbass, Hazem M. Bahig

Publication date 4 February 2015

Published in Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11786-013-0165-6

zbMATH Keywords

DNA motifsexact algorithmspattern matchingplanted \((l, d)\)-motiftranscription factor binding sites

Mathematics Subject Classification ID

Algorithms on strings (68W32) Protein sequences, DNA sequences (92D20)

Recommendations

• Identifying DNA motifs based on match and mismatch alignment information
• A Compact Mathematical Programming Formulation for DNA Motif Finding
• An efficient algorithm for deciphering regulatory motifs
• scientific article; zbMATH DE number 2113956
• Efficient algorithms for finding edit-distance based motifs

Cites work

• Computing and Combinatorics
• Space and Time Efficient Algorithms for Planted Motif Search

Cited in

(10)

• EMS1: an elegant algorithm for edit distance based motif search
• scientific article; zbMATH DE number 5671091 (Why is no real title available?)
• Space and Time Efficient Algorithms for Planted Motif Search
• A motif finding algorithm based on color coding technology
• Identifying DNA motifs based on match and mismatch alignment information
• scientific article; zbMATH DE number 1983142 (Why is no real title available?)
• An improved voting algorithm for planted \((l, d)\) motif search
• A Compact Mathematical Programming Formulation for DNA Motif Finding
• Improving a greedy DNA motif search using a multiple genomic self-adaptating genetic algo\-rithm
• Algorithms and Computation

Describes a project that uses

Uses Software

• TRANSFAC
• TEIRESIAS
• PMS5

This page was built for publication: An efficient algorithm to identify DNA motifs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2254087)