Pareto optimization in algebraic dynamic programming

Pareto optimization combines independent objectives by computing the Pareto front of its search space, defined as the set of all solutions for which no other candidate solution scores better under all objectives. This gives, in a precise sense, better information than an artificial amalgamation of d...

Full description

Bibliographic Details

Published in:	Algorithms for molecular biology Vol. 10; no. 1; p. 22
Main Authors:	Saule, Cédric, Giegerich, Robert
Format:	Journal Article
Language:	English
Published:	London BioMed Central 07.07.2015 BioMed Central Ltd Springer Nature B.V
Subjects:	Algorithms Bioinformatics Biomedical and Life Sciences Cellular and Medical Topics Computational Biology/Bioinformatics Life Sciences Pareto efficiency Physiological Pareto optimization Algebraic dynamic programming Dynamic programming Sankoff algorithm RNA structure
ISSN:	1748-7188, 1748-7188
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!