Contemporary studies address both the feasibility of algorithmic solutions and the limits imposed by complexity classes, offering insights into issues such as NP-hardness and inapproximability.

Algorithm design strategies such as divide and conquer. Elementary techniques for analysis; asymptotic analysis, recursion equations, estimation methods, elementary combinatorial arguments.

This paper presents the Levinson algorithm, its rediscoveries and extensions. A review is given of the applications of the procedure to several areas of interest in the field of time series analysis. ...

Researchers at the Sanford Burnham Prebys Medical Discovery Institute (SBP) say they have begun the first comparative analysis of a new category of algorithms that mine genetic information in ...

Asger Hobolth, A Markov Chain Monte Carlo Expectation Maximization Algorithm for Statistical Analysis of DNA Sequence Evolution with Neighbor-Dependent Substitution Rates, Journal of Computational and ...