- Applied mathematics
- >
- Algorithms
- >
- Algorithms on strings
- >
- Sequence alignment algorithms

- Applied mathematics
- >
- Algorithms
- >
- Bioinformatics algorithms
- >
- Sequence alignment algorithms

- Combinatorics on words
- >
- Formal languages
- >
- Algorithms on strings
- >
- Sequence alignment algorithms

- Data types
- >
- String (computer science)
- >
- Algorithms on strings
- >
- Sequence alignment algorithms

- Formalism (deductive)
- >
- Formal languages
- >
- Algorithms on strings
- >
- Sequence alignment algorithms

- Mathematical logic
- >
- Algorithms
- >
- Algorithms on strings
- >
- Sequence alignment algorithms

- Mathematical logic
- >
- Algorithms
- >
- Bioinformatics algorithms
- >
- Sequence alignment algorithms

- Mathematical logic
- >
- Formal languages
- >
- Algorithms on strings
- >
- Sequence alignment algorithms

- Metalogic
- >
- Formal languages
- >
- Algorithms on strings
- >
- Sequence alignment algorithms

- Sequences and series
- >
- String (computer science)
- >
- Algorithms on strings
- >
- Sequence alignment algorithms

- Theoretical computer science
- >
- Algorithms
- >
- Algorithms on strings
- >
- Sequence alignment algorithms

- Theoretical computer science
- >
- Algorithms
- >
- Bioinformatics algorithms
- >
- Sequence alignment algorithms

- Theoretical computer science
- >
- Formal languages
- >
- Algorithms on strings
- >
- Sequence alignment algorithms

Hirschberg's algorithm

In computer science, Hirschberg's algorithm, named after its inventor, Dan Hirschberg, is a dynamic programming algorithm that finds the optimal sequence alignment between two strings. Optimality is m

Needleman–Wunsch algorithm

The Needleman–Wunsch algorithm is an algorithm used in bioinformatics to align protein or nucleotide sequences. It was one of the first applications of dynamic programming to compare biological sequen

Smith–Waterman algorithm

The Smith–Waterman algorithm performs local sequence alignment; that is, for determining similar regions between two strings of nucleic acid sequences or protein sequences. Instead of looking at the e

Probalign

Probalign is a sequence alignment tool that calculates a maximum alignment using partition function posterior probabilities. Base pair probabilities are estimated using an estimate similar to Boltzman

Maximal unique match

A maximal unique match or MUM, for short, is part of a key step in the multiple sequence alignment of genomes in computational biology. Identification of MUMs and other potential anchors, is the first

Sequence alignment

In bioinformatics, a 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 evolutiona

© 2023 Useful Links.