![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Article
Open AccessMeasurable residual disease quantification in adult patients with KMT2A-rearranged acute lymphoblastic leukemia
-
Article
Comparison of minimal residual disease levels in bone marrow and peripheral blood in adult acute lymphoblastic leukemia
-
Article
Open AccessMRD response in relapsed/refractory FL after obinutuzumab plus bendamustine or bendamustine alone in the GADOLIN trial
We report assessment of minimal residual disease (MRD) status and its association with outcome in rituximab-refractory follicular lymphoma (FL) in the randomized GADOLIN trial (NCT01059630). Patients received ...
-
Chapter and Conference Paper
Multi-objective Problems in Terms of Relational Algebra
Relational algebra has been shown to be a powerful tool for solving a wide range of combinatorial optimization problems with small computational and programming effort. The problems considered in recent years ...
-
Chapter and Conference Paper
Relational Construction of Specific Timetables
We use relation algebra to model an abstract timetabling problem and to compute solutions. The problem was posed to us by the administration of our university and stems from the current change from the classic...
-
Chapter and Conference Paper
Relation Algebra and RelView in Practical Use: Construction of Special University Timetables
In this paper, we are concerned with a special timetabling problem. It was posed to us by the administration of our university and stems from the adoption of the British-American system of university education...
-
Chapter and Conference Paper
Relational Implementation of Simple Parallel Evolutionary Algorithms
Randomized search heuristics, among them evolutionary algorithms, are applied to problems whose structure is not well understood, as well as to hard problems in combinatorial optimization to get near-optimal s...
-
Chapter and Conference Paper
A Relation-Algebraic View on Evolutionary Algorithms for Some Graph Problems
We take a relation-algebraic view on the formulation of evolutionary algorithms in discrete search spaces. First, we show how individuals and populations can be represented as relations and formulate some stan...
-
Chapter and Conference Paper
Evaluating Sets of Search Points Using Relational Algebra
We model a set of search points as a relation and use relational algebra to evaluate all elements of the set in one step in order to select search points with certain properties. Therefore we transform relatio...