Searching protein structure databases with DaliLite v.3 Export

@article{citeulike:3683162, abstract = {The Red Queen said, It takes all the running you can do, to keep in the same place.' Lewis Carrol Motivation: Newly solved protein structures are routinely scanned against structures already in the Protein Data Bank (PDB) using Internet servers. In favourable cases, comparing 3D structures may reveal biologically interesting similarities that are not detectable by comparing sequences. The number of known structures continues to grow exponentially. Sensitive--thorough but slow--search algorithms are challenged to deliver results in a reasonable time, as there are now more structures in the PDB than seconds in a day. The brute-force solution would be to distribute the individual comparisons on a massively parallel computer. A frugal solution, as implemented in the Dali server, is to reduce the total computational cost by pruning search space using prior knowledge about the distribution of structures in fold space. This note reports paradigm revisions that enable maintaining such a knowledge base up-to-date on a PC. Availability: The Dali server for protein structure database searching at http://ekhidna.biocenter.helsinki.fi/dali\_server is running DaliLite v.3. The software can be downloaded for academic use from http://ekhidna.biocenter.helsinki.fi/dali\_lite/downloads/v3. Contact: liisa.holm@helsinki.fi 10.1093/bioinformatics/btn507}, author = {Holm, L. and Kaariainen, S. and Rosenstrom, P. and Schenkel, A.}, citeulike-article-id = {3683162}, citeulike-linkout-0 = {http://dx.doi.org/10.1093/bioinformatics/btn507}, citeulike-linkout-1 = {http://bioinformatics.oxfordjournals.org/cgi/content/abstract/24/23/2780?rss=1}, citeulike-linkout-2 = {http://view.ncbi.nlm.nih.gov/pubmed/18818215}, citeulike-linkout-3 = {http://www.hubmed.org/display.cgi?uids=18818215}, day = {1}, doi = {10.1093/bioinformatics/btn507}, journal = {Bioinformatics}, keywords = {0dali}, month = {December}, number = {23}, pages = {2780--2781}, posted-at = {2009-01-10 00:47:17}, priority = {2}, title = {Searching protein structure databases with DaliLite v.3}, url = {http://dx.doi.org/10.1093/bioinformatics/btn507}, volume = {24}, year = {2008} }

TY - JOUR ID - citeulike:3683162 L3 - citeulike-article-id:3683162 N2 - The Red Queen said, It takes all the running you can do, to keep in the same place.' Lewis Carrol Motivation: Newly solved protein structures are routinely scanned against structures already in the Protein Data Bank (PDB) using Internet servers. In favourable cases, comparing 3D structures may reveal biologically interesting similarities that are not detectable by comparing sequences. The number of known structures continues to grow exponentially. Sensitive--thorough but slow--search algorithms are challenged to deliver results in a reasonable time, as there are now more structures in the PDB than seconds in a day. The brute-force solution would be to distribute the individual comparisons on a massively parallel computer. A frugal solution, as implemented in the Dali server, is to reduce the total computational cost by pruning search space using prior knowledge about the distribution of structures in fold space. This note reports paradigm revisions that enable maintaining such a knowledge base up-to-date on a PC. Availability: The Dali server for protein structure database searching at http://ekhidna.biocenter.helsinki.fi/dali_server is running DaliLite v.3. The software can be downloaded for academic use from http://ekhidna.biocenter.helsinki.fi/dali_lite/downloads/v3. Contact: liisa.holm@helsinki.fi 10.1093/bioinformatics/btn507 IS - 23 JF - Bioinformatics EP - 2781 TI - Searching protein structure databases with DaliLite v.3 VL - 24 SP - 2780 KW - 0dali AU - Holm, L AU - Kaariainen, S AU - Rosenstrom, P AU - Schenkel, A PY - 2008/12/01/ UR - http://dx.doi.org/10.1093/bioinformatics/btn507 ER -