Experience report: Haskell in computational biology

Authors:
Noah M. Daniels;Andrew Gallant;Norman Ramsey
Affiliations:
Tufts University, Medford, MA, USA;Tufts University, Medford, MA, USA;Tufts University, Medford, MA, USA
Venue:
Proceedings of the 17th ACM SIGPLAN international conference on Functional programming
Year:
2012

Citing 4
Cited 1

Why functional programming matters

The Computer Journal - Special issue on Lazy functional programming
Formally based profiling for higher-order functional languages

ACM Transactions on Programming Languages and Systems (TOPLAS)
Error bounds for convolutional codes and an asymptotically optimum decoding algorithm

IEEE Transactions on Information Theory
SMURFLite

Bioinformatics

MRFy: Remote Homology Detection for Beta-Structural Proteins Using Markov Random Fields and Stochastic Search

Proceedings of the International Conference on Bioinformatics, Computational Biology and Biomedical Informatics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Haskell gives computational biologists the flexibility and rapid prototyping of a scripting language, plus the performance of native code. In our experience, higher-order functions, lazy evaluation, and monads really worked, but profiling and debugging presented obstacles. Also, Haskell libraries vary greatly: memoization combinators and parallel-evaluation strategies helped us a lot, but other, nameless libraries mostly got in our way. Despite the obstacles and the uncertain quality of some libraries, Haskell's ecosystem made it easy for us to develop new algorithms in computational biology.