SNPServer combines BLAST, cap3 and a SNP discovery module into a single pipeline for the discovery of SNPs in user submitted files or dynamically created assemblies.
The Berkeley Phylogenomics Group provides a series of
web servers for phylogenomic analysis: classification of sequences to pre-computed families and subfamilies using the PhyloFacts Phylogenomic Encyclopedia, FlowerPower clustering of proteins sharing the same domain architecture, MUSCLE multiple sequence alignment, SATCHMO simultaneous alignment and tree construction, and SCI-PHY subfamily identification.
Boltzmann Time Warping (BTW) computes time warping distances and Boltzmann\' pair probabilities for a given input gene expression time series. This tool helps to identify genes that may share similar expression patterns over time.
CD-Search allows the user to search the Conserved Domain Database (CDD) for conserved structural and functional domains in a sequence of interest; links to 3-D structures where applicable.
ClusPro is a tool for automatically computing the docking of two protein structures supplied by the user (or as PDB IDs). The result set is a ranked list of putative complexes, ordered by clustering properties.
Influenza Virus Resource presents data obtained from the NIAID Influenza Genome Sequencing Project as well as from GenBank, combined with tools for flu sequence analysis and annotation. In addition, it provides links to other resources that contain flu sequences, publications and general information about flu viruses.
Server designed to pinpoint protein-DNA interaction sites at the base pair level. Uses ChIP-array data, word enumeration and position-specific weight matrix updating to search for motifs representing these interaction sites.
MRS is a biological data retrieval system that can be accessed over the web, or installed and used locally. MRS indexes several flat-file data sets for searching, including EMBL nucleotide, UniProt, PDB and KEGG. Searches can be performed globally, or on one or more flat file fields per data set.
ParAlign provides a service for sequence similarity searching powered by parallel computing technology. The two comparison algorithms used are Smith-Waterman and ParAlign (a heuristic method for sequence alignment).
Polypeptide Angles Suffix Tree (PAST) provides methods for searching three-dimensional protein structures and
identifying frequent common substructures (structural motifs) using an approach independent of the sequence of amino acids.
pdbFun allows the user to search the PDB as a database of annotated residues. One can limit the search by annotations such as domains, binding sites, active sites, solvent exposure and residue type.