Other

MPsrch is a biological sequence sequence comparison tool that implements the true Smith and Waterman algorithm. It allows an rigorous search in a reasonable computational time. MPsrch utilises an exhaustive algorithm, which is recognised as the most sensitive sequence comparison method available, whereas BLAST and FASTA utilise a heuristic one. As a consequence, MPsrch is capable of identifying hits in cases where BLAST and FASTA fail and also reports fewer false-positive hits.

The Chaotic Map Clustering algorithm performs a non-parametric hierarchical partition of data without prior assumptions about numbers of classes and geometric distribution of clusters; as a result, the hierarchical structure of data is obtained as a tree of clusters.

PatSearch is a flexible and fast pattern matcher able to search for specific combinations of oligonucleotide consensus sequences, secondary structure elements and position-weight matrices. It can also allow for mismatches/mispairings below a user fixed threshold.

This server is for prediction of transmembrane topology and signal peptides from the amino acid sequence of a protein.