Skip to main content
×
Home
    • Aa
    • Aa

Calculating PSSM probabilities with lazy dynamic programming

  • KETIL MALDE (a1) and ROBERT GIEGERICH (a2)
  • DOI: http://dx.doi.org/10.1017/S0956796805005708
  • Published online: 01 January 2006
Abstract

Position-specific scoring matrices are one way to represent approximate string patterns, which are commonly encountered in the field of bioinformatics. An important problem that arises with their application is calculating the statistical significance of matches. We review the currently most efficient algorithm for this task, and show how it can be implemented in Haskell, taking advantage of the built-in non-strictness of the language. The resulting program turns out to be an instance of dynamic programming, using lists rather the typical dynamic programming matrix.

Copyright
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Journal of Functional Programming
  • ISSN: 0956-7968
  • EISSN: 1469-7653
  • URL: /core/journals/journal-of-functional-programming
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×