Author:
Hoppe Andreas,Frömmel Cornelius
Abstract
A program that computes molecular superpositions is presented. A possible large molecule (target =haystack) is scanned for the occurrence of a given molecular motif (model =needle) within tolerances. The advance over other methods is that it can handle very large atom sets,e.g.targets of up to 100000 atoms, and does not necessarily require any chemical information and connectivity between atoms: chemical constraints to restrict the solution space are not used to relate non-obvious superpositions based on a geometric fit. The specialization to a needle-in-a-haystack problem allows a very fast algorithm. Trade-offs between run time and tolerance levels are possible. The program is fast enough to screen large databases in an acceptable time. An executable for Linux on Pentium-compatible machines is available free of charge at http://www.charite.de/bioinf/haystack. It is a command-line executable well suited for scripts and distributed computing. A Web interface for immediate testing is also available at this address.
Publisher
International Union of Crystallography (IUCr)
Subject
General Biochemistry, Genetics and Molecular Biology
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Background;Computational Strategies Towards Improved Protein Function Prophecy of Xylanases from Thermomyces lanuginosus;2012
2. Superimpose: a 3D structural superposition server;Nucleic Acids Research;2008-05-19
3. Docking without docking: ISEARCH-prediction of interactions using known interfaces;Proteins: Structure, Function, and Bioinformatics;2007-09-05
4. AN FPTAS FOR COMPUTING THE SIMILARITY OF THREE-DIMENSIONAL POINT SETS;International Journal of Computational Geometry & Applications;2007-04
5. Using a Library of Structural Templates to Recognise Catalytic Sites and Explore their Evolution in Homologous Families;Journal of Molecular Biology;2005-04