Abstract
AbstractSeveral problems in computational chemistry, structural molecular biology, and biological chemistry can be solved by symbolic‐numerical algorithms. We introduce suitable algebraic tools and then survey their usage in concrete applications. In particular, questions on molecular structure can be modeled by systems of polynomial equations, mainly by drawing on techniques from robot kinematics. Resultant‐based algorithms, including sparse resultants and their matrix formulae, are described in order to reduce the solving of polynomial systems to numerical linear algebra. As an illustration, we focus on computing all conformations of cyclic molecules and on matching pharmacophores under distance constraints; in both cases, the number of independent degrees of freedom is relatively small. We summarize some existing results as well as sketch some original work. Both lead to complete and accurate solutions for those problems in the sense that our algorithms output all solutions with sufficiently high precision for the needs of biochemical applications. © 2005 Wiley Periodicals, Inc. Int J Quantum Chem, 2006
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
