Statically Indeterminate Problem Solving
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
Constraints and Statical Determinacy
Machines: Problem Solving II
Synthetic Disvision of Polynomials
Machines: Problem Solving I
You might also read
Articles linked to this work by shared authors, journal, and citation graph.
Updated: May 28, 2026

Hierarchical and Programmable One-Pot Oligosaccharide Synthesis
Published on: September 6, 2019
Leena Salmela1, Veli Mäkinen, Niko Välimäki
1Department of Computer Science, Helsinki Institute for Information Technology, University of Helsinki, Helsinki, Finland. leena.salmela@cs.helsinki.fi
MIP Scaffolder efficiently assembles large genomes by dividing the scaffolding problem into smaller, manageable subproblems using mixed integer programming. This novel approach yields superior or comparable results to existing methods, enhancing genome assembly accuracy.
Area of Science:
Background:
Purpose of the Study:
Main Methods:
Main Results:
Conclusions: