PAST: fast structure-based searching in the PDB
- PMID: 16844992
- PMCID: PMC1538836
- DOI: 10.1093/nar/gkl273
PAST: fast structure-based searching in the PDB
Abstract
PAST is a new web service providing fast structural queries of the Protein Data Bank. The search engine is based on an adaptation of the generalized suffix tree and relies on a translation- and rotation-invariant representation of the protein backbone. The search procedure is completely independent of the amino acid sequence of the polypeptide chains. The web service works best with, but is not necessarily limited to, shorter fragments such as functional motifs-a task that most other tools do not perform well. Usual query times are in the order of seconds, allowing a truly interactive use. Unlike most established tools, PAST does not prefilter the dataset or exclude parts of the search space based on statistical reasoning. The server is freely available at http://past.in.tum.de/.
Figures
References
-
- Holm L., Sander C. Searching protein structure databases has come of age. Proteins. 1994;19:165–173. - PubMed
-
- Shindyalov I.N., Bourne P.E. Protein structure alignment by incremental combinatorial extension (CE) of the optimal path. Protein Eng. 1998;11:739–747. - PubMed
-
- Gáspári Z., Vlahovicek K., Pongor S. Efficient recognition of folds in protein 3D structures by the improved PRIDE algorithm. Bioinformatics. 2005;21:3322–3323. - PubMed
-
- Gibrat J.-F., Madej T., Bryant S.H. Surprising similarities in structure comparison. Curr. Opin. Struct. Biol. 1996;6:377–385. - PubMed
MeSH terms
LinkOut - more resources
Full Text Sources
Miscellaneous
