Space and Time Efficient Algorithms for Planted Motif Search
From MaRDI portal
Publication:3545137
DOI10.1007/11758525_110zbMath1155.92313MaRDI QIDQ3545137
Sanguthevar Rajasekaran, Jaime Davila, Sudha Balla
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
68Q25: Analysis of algorithms and problem complexity
92C40: Biochemistry, molecular biology
92D10: Genetics and epigenetics
Related Items
Efficient Algorithms for the Closest String and Distinguishing String Selection Problems, A three-string approach to the closest string problem