Bioinformatics

Going beyond current bioinformatics approaches, computational biology needs to develop new methods to discover meaningful patterns in these large data sets.

neighbor joining is a bottom-up (agglomerative) clustering method for the creation of phylogenetic trees, created by Naruya Saitou and Masatoshi Nei in 1987. Usually based on DNA or protein sequence data, the algorithm requires knowledge of the distance betwee

sequence alignment is a way of arranging the sequences of DNA, RNA, or protein to identify regions of similarity that may be a consequence of functional, structural, or evolutionary relationships between the sequences.

Nussinov algorithm is a nucleic acid structure prediction algorithm used in computational biology to predict the folding of an RNA molecule that makes use of dynamic programming principles.

Robinson-Foulds or symmetric difference metric, often abbreviated as the RF distance, is a simple way to calculate the distance between phylogenetic trees.

quartet distance is a way of measuring the distance between two phylogenetic trees.

Velvet is an algorithm package that has been designed to deal with de novo genome assembly and short read sequencing alignments.

SPAdes (St. Petersburg genome assembler) is a genome assembly algorithm which was designed for single cell and multi-cells bacterial data sets.

The Shapiro-Senapathy algorithm (S&S) is a computational method for identifying splice sites in eukaryotic genes.