Next Article in Journal
Contemporary Network Proteomics and Its Requirements
Next Article in Special Issue
R-Based Software for the Integration of Pathway Data into Bioinformatic Algorithms
Previous Article in Journal
Root-Zone Glyphosate Exposure Adversely Affects Two Ditch Species
Previous Article in Special Issue
Portraying the Expression Landscapes of B-CellLymphoma-Intuitive Detection of Outlier Samples and of Molecular Subtypes
 
Search for Articles:
Title / Keyword
Author / Affiliation
Journal
Article Type
 
 
Advanced Search
 
Section
Special Issue
Volume
Issue
Number
Page
Journals
Biology
Volume 3
Issue 1
10.3390/biology3010001
biology-logo
Submit to this Journal Review for this Journal Edit a Special Issue
► Article Menu

Article Menu

share announcement question_answer thumb_up
...
textsms
...
Review

Algorithmic Perspectives of Network Transitive Reduction Problems and their Applications to Synthesis and Analysis of Biological Networks

by
Satabdi Aditya
1,
Bhaskar DasGupta
1,* and
Marek Karpinski
2
1
Department of Computer Science, University of Illinois at Chicago, Chicago, IL 60607, USA
2
Department of Computer Science, University of Bonn, Bonn 53113, Germany
*
Author to whom correspondence should be addressed.
Biology 2014, 3(1), 1-21; https://doi.org/10.3390/biology3010001
Received: 19 July 2013 / Revised: 11 November 2013 / Accepted: 9 December 2013 / Published: 19 December 2013
(This article belongs to the Special Issue Developments in Bioinformatic Algorithms)
View Full-Text Download PDF
Browse Figures

Abstract

In this survey paper, we will present a number of core algorithmic questions concerning several transitive reduction problems on network that have applications in network synthesis and analysis involving cellular processes. Our starting point will be the so-called minimum equivalent digraph problem, a classic computational problem in combinatorial algorithms. We will subsequently consider a few non-trivial extensions or generalizations of this problem motivated by applications in systems biology. We will then discuss the applications of these algorithmic methodologies in the context of three major biological research questions: synthesizing and simplifying signal transduction networks, analyzing disease networks, and measuring redundancy of biological networks. View Full-Text
Keywords: transitive reduction; minimum equivalent digraph; network synthesis; disease networks; combinatorial algorithms transitive reduction; minimum equivalent digraph; network synthesis; disease networks; combinatorial algorithms
►▼ Show Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License
SciFeed

Share and Cite

MDPI and ACS Style

Aditya, S.; DasGupta, B.; Karpinski, M. Algorithmic Perspectives of Network Transitive Reduction Problems and their Applications to Synthesis and Analysis of Biological Networks. Biology 2014, 3, 1-21. https://doi.org/10.3390/biology3010001

AMA Style

Aditya S, DasGupta B, Karpinski M. Algorithmic Perspectives of Network Transitive Reduction Problems and their Applications to Synthesis and Analysis of Biological Networks. Biology. 2014; 3(1):1-21. https://doi.org/10.3390/biology3010001

Chicago/Turabian Style

Aditya, Satabdi, Bhaskar DasGupta, and Marek Karpinski. 2014. "Algorithmic Perspectives of Network Transitive Reduction Problems and their Applications to Synthesis and Analysis of Biological Networks" Biology 3, no. 1: 1-21. https://doi.org/10.3390/biology3010001

Find Other Styles

Article Metrics

Article Access Map by Country/Region

1
Only visits after 24 November 2015 are recorded.
Back to TopTop