An algorithm is a finite set of steps to solve a problem or achieve a goal. It takes initial input and proceeds through a series of well-defined states until it reaches an output and terminates. FASTA is a widely used DNA and protein sequence alignment software that was first described in 1985. It uses a ubiquitous format for bioinformatics. There are different types of BLAST algorithms for comparing nucleotide and protein sequences.

1. BABA SAHEB BHIMRAO
AMBEDKAR UNIVERSITY
PRESENTATION ON
ALGORITHM
BY :- PRASHANT TRIPATHI
M.Sc[BBAU]

2. INTRODUCTION TO ALGORITHM
• An algorithm is an effective method that can be
expressed within a finite amount of space and
time and a well defined formal language for
calculating a function.
• Starting from an initial stage and initial input, the
instructions describe a computation that when
executed, proceeds through a finite no. of well
defined successive states, eventually producing a
output and terminated at a final ending states.

10. FASTA(FAST-All)
• FASTA is
a DNA and protein sequ
ence
alignment software
package first described
(as FASTP) by David J.
Lipman and William R.
Pearson in 1985. Its
legacy is the FASTA
format which is now
ubiquitous
in bioinformatics.

12. TYPES OF BLAST

13. STANDARD BLAST
• blastn : comparing the nucleotide sequence against the nucleotide
sequence database.
• blastp : comparing the amino acid query against the protein sequence
database.
• blastx : comparing the nucleotide query sequence translated in all reading
frames against the protein database.
• tblastn: comparing the protein query sequence against the nucleotide
database translated in all reading frames.
• tbalstx : comparing six reading frames translation of the nucleotide query
against six frame translations of the nucleotide sequence database.