Alessandro Andrioni

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
The Discretizable Molecular Distance Geometry Problem (DMDGP) consists in a subclass of the Molecular Distance Geometry Problem for which an embedding in R 3 can be found using a Branch & Prune (BP) algorithm in a discrete search space. We propose a Clifford Algebra model of the DMDGP with an accompanying version of the BP algorithm. 1. The discretizable(More)
  • 1