1. String Data Structures for Computational Molecular Biology

  1. Mourad Elloumi2 and
  2. Albert Y. Zomaya3
  1. Christos Makris and
  2. Evangelos Theodoridis

Published Online: 23 DEC 2010

DOI: 10.1002/9780470892107.ch1

Algorithms in Computational Molecular Biology: Techniques, Approaches and Applications

Algorithms in Computational Molecular Biology: Techniques, Approaches and Applications

How to Cite

Makris, C. and Theodoridis, E. (2011) String Data Structures for Computational Molecular Biology, 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.ch1

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. Computer Engineering and Informatics Department, University of Patras, Rio, Greece

Publication History

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

ISBN Information

Print ISBN: 9780470505199

Online ISBN: 9780470892107

SEARCH

Keywords:

  • strings processing and application to biological sequences;
  • string data structures - for computational molecular biology;
  • indeterminate or degenerate strings - strings in each position, and set of characters instead of a simple character

Summary

This chapter contains sections titled:

  • Introduction

  • Main String Indexing Data Structures

  • Index Structures for Weighted Strings

  • Index Structures for Indeterminate Strings

  • String Data Structures in Memory Hierarchies

  • Conclusions

  • References