Hostname: page-component-745bb68f8f-b6zl4 Total loading time: 0 Render date: 2025-01-12T02:47:42.249Z Has data issue: false hasContentIssue false
  • English
  • Français

Calculating PSSM probabilities with lazy dynamic programming

Published online by Cambridge University Press:  13 September 2005

KETIL MALDE  and
ROBERT GIEGERICH
KETIL MALDE
Affiliation:
Department of Informatics, University of Bergen, Bergen, Norway (e-mail: [email protected])
ROBERT GIEGERICH
Affiliation:
Faculty of Technology, University of Bielefeld, Bielefeld, Germany (e-mail: [email protected])
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

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.

Type
Article
Information
Journal of Functional Programming , Volume 16 , Issue 1 , January 2006 , pp. 75 - 81
Copyright
© 2005 Cambridge University Press
Submit a response

Discussions

No Discussions have been published for this article.