Two applications of the divide&conquer principle in the molecular sciences |
| |
Authors: | G Brinkmann A W M Dress S W Perrey J Stoye |
| |
Institution: | (1) Faculty of Mathematics, University of Bielefeld, Box 100 131, D-33501 Bielefeld, Germany |
| |
Abstract: | In this paper, two problems from the molecular sciences are addressed: the enumeration of fullerene-type isomers and the alignment
of biosequences. We report on two algorithms dealing with these problems both of which are based on the well-known and widely
used Divide&Conquer principle. In other words, our algorithms attack the original problems by associating with them an appropriate
number of much simpler problems whose solutions can be “glued together” to yield solutions of the original, rather complex
tasks. The considerable improvements achieved this way exemplify that the present day molecular sciences offer many worthwhile
opportunities for the effective use of fundamental algorithmic principles and architectures. |
| |
Keywords: | Divide& Conquer Structure enumeration Fullerenes Multiple sequence allignment |
本文献已被 SpringerLink 等数据库收录! |