de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Disclaimer Contact us Login
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Journal Article

Detecting hierarchical structure in molecular characteristics of disease using transitive approximations of directed graphs

MPS-Authors

Jentsch,  Marcel
Max Planck Society;

Kostka,  Dennis
Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons50564

Spang,  Rainer
Dept. of Computational Molecular Biology (Head: Martin Vingron), Max Planck Institute for Molecular Genetics, Max Planck Society;

Locator
There are no locators available
Fulltext (public)

btn056v1.pdf
(Any fulltext), 269KB

Supplementary Material (public)
There is no public supplementary material available
Citation

Jacob, J., Jentsch, M., Kostka, D., Bentink, S., & Spang, R. (2008). Detecting hierarchical structure in molecular characteristics of disease using transitive approximations of directed graphs. Bioinformatics, 24(7), 995-1001. doi:10.1093/bioinformatics/btn056.


Cite as: http://hdl.handle.net/11858/00-001M-0000-0010-806A-0
Abstract
Motivation: Molecular diagnostics aims at classifying diseases into clinically relevant sub-entities based on molecular characteristics. Typically, the entities are split into subgroups, which might contain several variants yielding a hierarchical model of the disease. Recent years have introduced a plethora of new molecular screening technologies to molecular diagnostics. As a result molecular profiles of patients became complex and the classification task more difficult. Results: We present a novel tool for detecting hierarchical structure in binary datasets. We aim for identifying molecular characteristics, which are stochastically implying other characteristics. The final hierarchical structure is encoded in a directed transitive graph where nodes represent molecular characteristics and a directed edge from a node A to a node B denotes that almost all cases with characteristic B also display characteristic A. Naturally, these graphs need to be transitive. In the core of our modeling approach lies the problem of calculating good transitive approximations of given directed but not necessarily transitive graphs. By good transitive approximation we understand transitive graphs, which differ from the reference graph in only a small number of edges. It is known that the problem of finding optimal transitive approximation is NP-complete. Here we develop an efficient heuristic for generating good transitive approximations. We evaluate the computational efficiency of the algorithm in simulations, and demonstrate its use in the context of a large genome-wide study on mature aggressive lymphomas.