A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is
Computational problems can be classified according to their algorithmic complexity, which is defined based on how the resources needed to solve the problem, e.g. the execution time, scale with the problem size. Many problems in computational biology are computationally infeasible in the sense that the exhaustive search for the optimal solution is prohibitive in practical terms. As a consequence, these problems are tackled through heuristics and approximations aiming to overcome the exceedingarXiv:1811.07312v2 fatcat:f6qnbrilnrh3zomveqptsjbbju