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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Algorithms for molecular biology Jg. 10; H. 1; S. 22
Hauptverfasser:	Saule, Cédric, Giegerich, Robert
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	London BioMed Central 07.07.2015 BioMed Central Ltd Springer Nature B.V
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!