Space and Time Efficient Algorithms for Planted Motif Search

DOI10.1007/11758525_110zbMath1155.92313OpenAlexW1583782919MaRDI QIDQ3545137

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)

Related Items (4)

Efficient Algorithms for the Closest String and Distinguishing String Selection Problems ⋮ A three-string approach to the closest string problem ⋮ An efficient algorithm to identify DNA motifs ⋮ Randomized fixed-parameter algorithms for the closest string problem

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