 Dear students, now I'll be elaborating on the types of fast A or fast alignment algorithms and the types that are available for the algorithm. So to start with, the fast alignment can help you search and compare the protein, DNA or RNA sequences by looking at the database for each one of them. Also once you have found matching words within the query sequence, then you can use these words and perform the Smith-Wattman algorithm and arrive at an overall alignment. So to start with, the first type of fast A is the fast A35. So it can help you to scan a protein or a DNA versus another protein or DNA database. So essentially any comparison that you want to do can be performed by fast A35. The next type of fast A is the fast X35. So this can help you to compare the translated DNA sequence to a protein sequence database. So on one side you have a DNA sequence that is your query and on the other side you have a protein database. So all six open reading frames are calculated by looking at the DNA or the RNA sequence and then they are converted into a protein for comparison. The third type is the T-fast X35. So it can help you to compare a protein sequence to a DNA database. So on this side that is your query is a protein sequence while on the database side you have a DNA database. So what you do is you take one sequence from the nucleotide database and you compute all six ORFs and translate them into proteins and then perform the comparison. Next is the fast Y. So it can compare a DNA sequence that is all six ORFs, the open reading frames and you can compare them to the proteins that are there in the protein database. Next is the fast S35. So this is a special type of fast A because it can help you to compare unordered peptides to a protein sequence database. So if you have some unordered peptide then you can look at the database as well and this can be extremely useful and powerful tool as well. The next is the fast M35 wherein you have an ordered set of peptides versus a DNA database. So when I say a DNA or an RNA database, so essentially it's a nucleotide database and we compare the all six open reading frames that can be created by each sequence within the database and then look at the protein sequence followed by its comparison with your query sequence. So in conclusion, there are several types of fast A which you can use depending on your need and that these algorithms can help you to create alignments and comparisons between sequences in a very fast manner. Also several types of these algorithms are there and all of them are available online. So you don't have to write them yourself, all you have to do is just go to the corresponding online resource and utilize the algorithm.