The application of genetic algorithms to the prediction of interfacial structure poses problems not encountered in calculations on bulk crystals or clusters.

In this paper, the set covering problem (SCP) is considered. Several algorithms have been suggested in the literature for solving it. We propose a new algorithm for solving the SCP which is based on ...

The author presents a rapidly convergent algorithm to solve the general portfolio problem of maximizing concave utility functions subject to linear constraints. The algorithm is based on an iterative ...

moPepGen leverages a graph-based approach to improve the detection of hidden protein variants in a computationally efficient manner.