2. Efficient Restricted-Case Algorithms for Problems in Computational Biology

  1. Mourad Elloumi3 and
  2. Albert Y. Zomaya4
  1. Patricia A. Evans1 and
  2. H. Todd Wareham2

Published Online: 23 DEC 2010

DOI: 10.1002/9780470892107.ch2

Algorithms in Computational Molecular Biology: Techniques, Approaches and Applications

Algorithms in Computational Molecular Biology: Techniques, Approaches and Applications

How to Cite

Evans, P. A. and Wareham, H. T. (2011) Efficient Restricted-Case Algorithms for Problems in Computational 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.ch2

Editor Information

  1. 3

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

  2. 4

    School of Information Technologies, The University of Sydney, Australia

Author Information

  1. 1

    Faculty of Computer Science, University of New Brunswick, Fredericton, Canada

  2. 2

    Department of Computer Science, Memorial University of Newfoundland, St. John's, Canada

Publication History

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

ISBN Information

Print ISBN: 9780470505199

Online ISBN: 9780470892107

SEARCH

Keywords:

  • efficient restricted-case algorithms - and problems in computational biology;
  • Longest Common Subsequence (LCS) - most basic formal computational problem associated with sequence alignment;
  • common approximate substring, basic formal computational problem - associated with sequence consensus

Summary

This chapter contains sections titled:

  • The Need for Special Cases

  • Assessing Efficient Solvability Options for General Problems and Special Cases

  • String and Sequence Problems

  • Shortest Common Superstring

  • Longest Common Subsequence

  • Common Approximate Substring

  • Conclusion

  • References