The University of Southampton
University of Southampton Institutional Repository

DADA: Degree-Aware Algorithms for Network-Based Disease Gene Prioritization.

DADA: Degree-Aware Algorithms for Network-Based Disease Gene Prioritization.
DADA: Degree-Aware Algorithms for Network-Based Disease Gene Prioritization.
BACKGROUND: High-throughput molecular interaction data have been used effectively to prioritize candidate genes that are linked to a disease, based on the observation that the products of genes associated with similar diseases are likely to interact with each other heavily in a network of protein-protein interactions (PPIs). An important challenge for these applications, however, is the incomplete and noisy nature of PPI data. Information flow based methods alleviate these problems to a certain extent, by considering indirect interactions and multiplicity of paths.

RESULTS: We demonstrate that existing methods are likely to favor highly connected genes, making prioritization sensitive to the skewed degree distribution of PPI networks, as well as ascertainment bias in available interaction and disease association data. Motivated by this observation, we propose several statistical adjustment methods to account for the degree distribution of known disease and candidate genes, using a PPI network with associated confidence scores for interactions. We show that the proposed methods can detect loosely connected disease genes that are missed by existing approaches, however, this improvement might come at the price of more false negatives for highly connected genes. Consequently, we develop a suite called DADA, which includes different uniform prioritization methods that effectively integrate existing approaches with the proposed statistical adjustment strategies. Comprehensive experimental results on the Online Mendelian Inheritance in Man (OMIM) database show that DADA outperforms existing methods in prioritizing candidate disease genes.

CONCLUSIONS: These results demonstrate the importance of employing accurate statistical models and associated adjustment methods in network-based disease gene prioritization, as well as other network-based functional inference applications. DADA is implemented in Matlab and is freely available at http://compbio.case.edu/dada/
1756-0381
19-[20pp]
Erten, Sinan
922b3d28-2c37-4bc6-933c-39274b133418
Bebek, Gurkan
c031784e-1689-4300-beb9-612424e27ac9
Ewing, Rob M.
022c5b04-da20-4e55-8088-44d0dc9935ae
Koyutürk, Mehmet
749aecc7-fa90-489e-85d4-7b512d5de6eb
Erten, Sinan
922b3d28-2c37-4bc6-933c-39274b133418
Bebek, Gurkan
c031784e-1689-4300-beb9-612424e27ac9
Ewing, Rob M.
022c5b04-da20-4e55-8088-44d0dc9935ae
Koyutürk, Mehmet
749aecc7-fa90-489e-85d4-7b512d5de6eb

Erten, Sinan, Bebek, Gurkan, Ewing, Rob M. and Koyutürk, Mehmet (2011) DADA: Degree-Aware Algorithms for Network-Based Disease Gene Prioritization. BioData Mining, 4, 19-[20pp]. (doi:10.1186/1756-0381-4-19). (PMID:21699738)

Record type: Article

Abstract

BACKGROUND: High-throughput molecular interaction data have been used effectively to prioritize candidate genes that are linked to a disease, based on the observation that the products of genes associated with similar diseases are likely to interact with each other heavily in a network of protein-protein interactions (PPIs). An important challenge for these applications, however, is the incomplete and noisy nature of PPI data. Information flow based methods alleviate these problems to a certain extent, by considering indirect interactions and multiplicity of paths.

RESULTS: We demonstrate that existing methods are likely to favor highly connected genes, making prioritization sensitive to the skewed degree distribution of PPI networks, as well as ascertainment bias in available interaction and disease association data. Motivated by this observation, we propose several statistical adjustment methods to account for the degree distribution of known disease and candidate genes, using a PPI network with associated confidence scores for interactions. We show that the proposed methods can detect loosely connected disease genes that are missed by existing approaches, however, this improvement might come at the price of more false negatives for highly connected genes. Consequently, we develop a suite called DADA, which includes different uniform prioritization methods that effectively integrate existing approaches with the proposed statistical adjustment strategies. Comprehensive experimental results on the Online Mendelian Inheritance in Man (OMIM) database show that DADA outperforms existing methods in prioritizing candidate disease genes.

CONCLUSIONS: These results demonstrate the importance of employing accurate statistical models and associated adjustment methods in network-based disease gene prioritization, as well as other network-based functional inference applications. DADA is implemented in Matlab and is freely available at http://compbio.case.edu/dada/

This record has no associated files available for download.

More information

Published date: 24 June 2011
Organisations: Molecular and Cellular

Identifiers

Local EPrints ID: 355404
URI: http://eprints.soton.ac.uk/id/eprint/355404
ISSN: 1756-0381
PURE UUID: 803fd58d-a6f8-4d4d-bec6-038a0d50e54a
ORCID for Rob M. Ewing: ORCID iD orcid.org/0000-0001-6510-4001

Catalogue record

Date deposited: 27 Aug 2013 11:32
Last modified: 15 Mar 2024 03:44

Export record

Altmetrics

Contributors

Author: Sinan Erten
Author: Gurkan Bebek
Author: Rob M. Ewing ORCID iD
Author: Mehmet Koyutürk

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×