Rethinking Bioinformatic Algorithms Using F#
source link: https://skillsmatter.com/skillscasts/14894-rethinking-bioinformatic-algorithms-using-f-sharp
Go to the source link to view the article. You can view the picture content, updated content and better typesetting reading experience. If the link is broken, please click the button below to view the snapshot at that time.
Please log in to watch this conference skillscast.
In this talk Jamie Dixon addresses two problems in biomedical research — reproducibility & complexity — by looking at basic implementation of pattern matching DNA/RNA sequences using traditional code constructs and then reimplementing them using F#.
One of the larger problems in biomedical research is reproducibility: consistent results of the same experiment is often elusive. Another problem is one of complexity — biology is inherently a complex subject and implementing it in computer code often leads to even more complications. Both of these problems can be traced, in part, to the choice of computer languages used when doing experiments.
In this session, we will look at a basic implementation of pattern matching DNA/RNA sequences using traditional code constructs and then reimplement them using F# using functional constructs. We will touch on why the F# solution addresses both the reproducibility problem as well as the code complexity problem. After this session, the attendee will gain a greater appreciation of the power of F# and how it can make complex algorithms simple.
YOU MAY ALSO LIKE:
Recommend
About Joyk
Aggregate valuable and interesting links.
Joyk means Joy of geeK