On optimal comparability editing with applications to molecular diagnostics.
BACKGROUND
The COMPARABILITY EDITING problem appears in the context of hierarchical disease classification based on noisy data. We are given a directed graph G representing hierarchical relationships between patient subgroups. The task is to identify the minimum number of edge insertions or deletions to transform G into a transitive graph, that is, if edges (u, v) and (v, w) are present then edge (u, w) must be present, too.


RESULTS
We present two new approaches for the problem based on fixed-parameter algorithmics and integer linear programming. In contrast to previously used heuristics, our approaches compute provably optimal solutions.


CONCLUSIONS
Our computational results demonstrate that our exact algorithms are by far more efficient in practice than a previously used heuristic approach. In addition to the superior running time performance, our algorithms are capable of enumerating all optimal solutions, and naturally solve the weighted version of the problem.
Böcker
Sebastian
S
Institut für Informatik, Friedrich-Schiller-Universität, Jena, Germany. boecker@minet.uni-jena.de
Briesemeister
Sebastian
S
Klau
Gunnar W
GW
D000465:Algorithms; D006801:Humans; D025202:Molecular Diagnostic Techniques / Q000379:methods* / Q000706:statistics & numerical data; D011382:Programming, Linear; D012984:Software