18. Motif Finding Algorithms in Biological Sequences

  1. Mourad Elloumi2 and
  2. Albert Y. Zomaya3
  1. Tarek El Falah2,
  2. Mourad Elloumi2 and
  3. Thierry Lecroq1

Published Online: 23 DEC 2010

DOI: 10.1002/9780470892107.ch18

Algorithms in Computational Molecular Biology: Techniques, Approaches and Applications

Algorithms in Computational Molecular Biology: Techniques, Approaches and Applications

How to Cite

Falah, T. E., Elloumi, M. and Lecroq, T. (2011) Motif Finding Algorithms in Biological Sequences, in Algorithms in Computational Molecular Biology: Techniques, Approaches and Applications (eds M. Elloumi and A. Y. Zomaya), John Wiley & Sons, Inc., Hoboken, NJ, USA. doi: 10.1002/9780470892107.ch18

Editor Information

  1. 2

    Unit of Technologies of Information and Communication (UTIC) and University of Tunis-El Manar, Tunisia

  2. 3

    School of Information Technologies, The University of Sydney, Australia

Author Information

  1. 1

    LITIS, University of Rouen, France

  2. 2

    Unit of Technologies of Information and Communication (UTIC) and University of Tunis-El Manar, Tunisia

Publication History

  1. Published Online: 23 DEC 2010
  2. Published Print: 18 JAN 2011

ISBN Information

Print ISBN: 9780470505199

Online ISBN: 9780470892107

SEARCH

Keywords:

  • motif finding and structure prediction in biological sequences - finding substrings, more or less conserved in a set of strings;
  • Planted (l,d)-motif problem, problem formulation - presenting algorithms addressing problem;
  • Edited motif problem, and existing algorithms - addressing EdMP, pattern-based ones, Speller, Deterministic Motif Search (DMS)

Summary

This chapter contains sections titled:

  • Introduction

  • Preliminaries

  • The Planted (l, d)-Motif Problem

  • The Extended (l, d)-Motif Problem

  • The Edited Motif Problem

  • The Simple Motif Problem

  • Conclusion

  • References