Rethinking Bioinformatic Algorithms Using F#

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:

• STOCK CARS, RASPBERRY PI, AND F# (SkillsCast recorded in April 2018)
• Functional Concurrency in .NET with C# and F# with Riccardo Terrell (Online Course on 8th - 11th March 2021)
• F# for a Real World E-commerce Project (SkillsCast recorded in October 2020)
• Declarative, Concise Implementation of a Rule-based Dialog System in F# (SkillsCast recorded in October 2020)