10. Efficient Combinatorial Algorithms for DNA Sequence Processing

  1. Ion I. Mǎndoiu3 and
  2. Alexander Zelikovsky4
  1. Bhaskar DasGupta1 and
  2. Ming-Yang Kao2

Published Online: 9 AUG 2007

DOI: 10.1002/9780470253441.ch10

Bioinformatics Algorithms: Techniques and Applications

Bioinformatics Algorithms: Techniques and Applications

How to Cite

DasGupta, B. and Kao, M.-Y. (2008) Efficient Combinatorial Algorithms for DNA Sequence Processing, in Bioinformatics Algorithms: Techniques and Applications (eds I. I. Mǎndoiu and A. Zelikovsky), John Wiley & Sons, Inc., Hoboken, NJ, USA. doi: 10.1002/9780470253441.ch10

Editor Information

  1. 3

    Department of Computer Science and Engineering, University of Connecticut, Storrs, Connecticut, USA

  2. 4

    Department of Computer Science, Georgia State University, Atlanta, GA, USA

Author Information

  1. 1

    Department of Computer Science, University of Illinois at Chicago, Chicago, IL, USA

  2. 2

    Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, USA

Publication History

  1. Published Online: 9 AUG 2007
  2. Published Print: 8 FEB 2008

ISBN Information

Print ISBN: 9780470097731

Online ISBN: 9780470253441

SEARCH

Keywords:

  • biological sequence analysis;
  • combinatorial optimization problem;
  • d-dimensional hyper-rectangles

Summary

This chapter contains sections titled:

  • Introduction

  • Nonoverlapping Local Alignments

  • Genome Tiling Problems

  • Acknowledgments

  • References