English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Journal Article

The Distance Precision Matrix: computing networks from non-linear relationships

MPS-Authors
/persons/resource/persons73753

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

/persons/resource/persons50407

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

/persons/resource/persons50613

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

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)

Ghanbari.pdf
(Publisher version), 805KB

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

Ghanbari, M., Lasserre, J., & Vingron, M. (2019). The Distance Precision Matrix: computing networks from non-linear relationships. Bioinformatics, 35(6), 1009-1017. doi:10.1093/bioinformatics/bty724.


Cite as: https://hdl.handle.net/21.11116/0000-0003-73F0-C
Abstract
Motivation: Full-order partial correlation, a fundamental approach for network reconstruction, e.g. in the context of gene regulation, relies on the precision matrix (the inverse of the covariance matrix) as an indicator of which variables are directly associated. The precision matrix assumes Gaussian linear data and its entries are zero for pairs of variables that are independent given all other variables. However, there is still very little theory on network reconstruction under the assumption of non-linear interactions among variables. Results: We propose Distance Precision Matrix, a network reconstruction method aimed at both linear and non-linear data. Like partial distance correlation, it builds on distance covariance, a measure of possibly non-linear association, and on the idea of full-order partial correlation, which allows to discard indirect associations. We provide evidence that the Distance Precision Matrix method can successfully compute networks from linear and non-linear data, and consistently so across different datasets, even if sample size is low. The method is fast enough to compute networks on hundreds of nodes. Availability: An R package DPM is available at https://github.molgen.mpg.de/ghanbari/DPM. Supplementary information: Supplementary data are available at Bioinformatics online.