A-F-V / Bioinformatics

Algorithms covered in the Bioinformatics Course part of the Cambridge Computer Science Tripos

Geek Repo:Geek Repo

Github PK Tool:Github PK Tool

CodeFactor Python Tests python ac_milan


This is a repository of all the algorithms covered in the Bioinformatics Course part of the Cambridge Computer Science Tripos

For some explanations, check out The Moon

Algorithms Implemented:

Alignment Problems:

  • Needleman-Wunsch
    • Calculate LCS and Edit Distance using this approach
  • Waterman-Smith
  • Affine Gap Model
  • Nussinov RNA Folding
  • Space Efficient Global Alignment (#todo cleanup)
  • Method of Four Russians for LCS
    • Extend to Edit Distance, Block Alignment and Global Alignment (for very simple score matrices)
  • The CLUSTAL W Mutliple Alignment

Phylogeny (Evolutionary Tree) Algorithms:

Distance Based:

Parsimony Based:

Genome Sequencing:

Clustering

Pattern Matching

Hidden Markov Models

Additional Files Explained:

  • Demos - A list of functions that can be used to demo the algorithms
  • Scoring Functions - Stores different scoring matrices encapsulated into a function to use in alignment problems
  • Alignment-Graph- A class for representing alignment/edit graphs
  • Rosalind - Answers to the Rosalind Questions

About

Algorithms covered in the Bioinformatics Course part of the Cambridge Computer Science Tripos


Languages

Language:Python 100.0%