Rethinking Bioinformatic Algorithms Using F#

Please log in to watch this conference skillscast.

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 Workshop on 11th - 14th October 2022)
• F# eXchange 2022: Online (Online Conference on 25th - 26th October 2022)
• F# eXchange 2022: In-Person (in London on 25th - 26th October 2022)
• Haskell: A Conversion Experience (SkillsCast recorded in November 2021)
• Using F# to Structure an Island of Simplicity (SkillsCast recorded in October 2021)