| Data: |
1997 |
| Resum: |
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. . |
| Drets: |
Tots els drets reservats.  |
| Llengua: |
Anglès |
| Document: |
Article ; recerca ; Versió publicada |
| Matèria: |
Divide&Conquer ;
Structure enumeration ;
Fullerenes ;
Multiple sequence allignment |
| Publicat a: |
Mathematical Programming, vol. 79 n. 1-3 (1997) p. 71-97, ISSN 0025-5610 |
visitant ::
identificació
Accés restringit a la UAB
