Space and Time Efficient Algorithms for Planted Motif Search

DOI10.1007/11758525_110MaRDI QIDQ3545137zbMATH OpenOpenAlexFDO

Authors Jaime Davila, Sudha Balla, Sanguthevar Rajasekaran

Publication date 9 December 2008

Published in Computational Science – ICCS 2006 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11758525_110

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Biochemistry, molecular biology (92C40) Genetics and epigenetics (92D10)

Recommendations

• An improved voting algorithm for planted \((l, d)\) motif search
• An efficient algorithm to identify DNA motifs
• Toward optimal motif enumeration.
• EMS1: an elegant algorithm for edit distance based motif search
• Sublinear time motif discovery from multiple sequences

Cited in

(7)

• An efficient algorithm to identify DNA motifs
• Randomized fixed-parameter algorithms for the closest string problem
• EMS1: an elegant algorithm for edit distance based motif search
• A three-string approach to the closest string problem
• An improved voting algorithm for planted \((l, d)\) motif search
• Efficient Algorithms for the Closest String and Distinguishing String Selection Problems
• An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence

This page was built for publication: Space and Time Efficient Algorithms for Planted Motif Search

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