The core sequence comparison method used in MPsrch is the Smith-Waterman dynamic programming algorithm generally recognized as the most sensitive sequence comparison method currently available. The computational rigor of this algorithm combined with a variety of adjustable search parameters, gives MPsrch its ability to find significant matches with fewer false hits.
MPsrch searches sequences in protein and DNA databases for similarity to the query sequence. Queries can include stop codons and IUPAC ambiguity codes. You can choose the scoring matrix, type of DNA "N" matching (how matches with unknown bases are scored), gap penalty, gap extension penalty, number of scores to report, and the number of sequences to align. Database entry annotation may be included in the output report. A ranking function (Collins 1993) is also available for protein searches.
Available programs are :
More information :