alexa Searching protein structure databases with DaliLite v.3.
Bioinformatics & Systems Biology

Bioinformatics & Systems Biology

Journal of Computer Science & Systems Biology

Author(s): Holm L, Kriinen S, Rosenstrm P, Schenkel A

Abstract Share this page

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 is running DaliLite v.3. The software can be downloaded for academic use from
This article was published in Bioinformatics and referenced in Journal of Computer Science & Systems Biology

Relevant Expert PPTs

Relevant Speaker PPTs

Recommended Conferences

Relevant Topics

Peer Reviewed Journals
Make the best use of Scientific Research and information from our 700 + peer reviewed, Open Access Journals
International Conferences 2017-18
Meet Inspiring Speakers and Experts at our 3000+ Global Annual Meetings

Contact Us

© 2008-2017 OMICS International - Open Access Publisher. Best viewed in Mozilla Firefox | Google Chrome | Above IE 7.0 version