Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 3 of 3

Full-Text Articles in Physical Sciences and Mathematics

A Novel Multithreaded Algorithm For Extracting Maximal Chordal Subgraphs, Mahantesh Halappanavar, John Feo, Kathryn Dempsey Cooper, Hesham Ali, Sanjukta Bhowmick Jan 2012

A Novel Multithreaded Algorithm For Extracting Maximal Chordal Subgraphs, Mahantesh Halappanavar, John Feo, Kathryn Dempsey Cooper, Hesham Ali, Sanjukta Bhowmick

Interdisciplinary Informatics Faculty Proceedings & Presentations

Chordal graphs are triangulated graphs where any cycle larger than three is bisected by a chord. Many combinatorial optimization problems such as computing the size of the maximum clique and the chromatic number are NP-hard on general graphs but have polynomial time solutions on chordal graphs. In this paper, we present a novel multithreaded algorithm to extract a maximal chordal sub graph from a general graph. We develop an iterative approach where each thread can asynchronously update a subset of edges that are dynamically assigned to it per iteration and implement our algorithm on two different multithreaded architectures - Cray …


On The Design Of Advanced Filters For Biological Networks Using Graph Theoretic Properties, Kathryn Dempsey Cooper, Tzu-Yi Chen, Sanjukta Bhowmick, Hesham Ali Jan 2012

On The Design Of Advanced Filters For Biological Networks Using Graph Theoretic Properties, Kathryn Dempsey Cooper, Tzu-Yi Chen, Sanjukta Bhowmick, Hesham Ali

Interdisciplinary Informatics Faculty Proceedings & Presentations

Network modeling of biological systems is a powerful tool for analysis of high-throughput datasets by computational systems biologists. Integration of networks to form a heterogeneous model requires that each network be as noise-free as possible while still containing relevant biological information. In earlier work, we have shown that the graph theoretic properties of gene correlation networks can be used to highlight and maintain important structures such as high degree nodes, clusters, and critical links between sparse network branches while reducing noise. In this paper, we propose the design of advanced network filters using structurally related graph theoretic properties. While spanning …


The Development Of Parallel Adaptive Sampling Algorithms For Analyzing Biological Networks, Kathryn Dempsey Cooper, Kanimathi Duraisamy, Sanjukta Bhowmick, Hesham Ali Jan 2012

The Development Of Parallel Adaptive Sampling Algorithms For Analyzing Biological Networks, Kathryn Dempsey Cooper, Kanimathi Duraisamy, Sanjukta Bhowmick, Hesham Ali

Interdisciplinary Informatics Faculty Proceedings & Presentations

The availability of biological data in massive scales continues to represent unlimited opportunities as well as great challenges in bioinformatics research. Developing innovative data mining techniques and efficient parallel computational methods to implement them will be crucial in extracting useful knowledge from this raw unprocessed data, such as in discovering significant cellular subsystems from gene correlation networks. In this paper, we present a scalable combinatorial sampling technique, based on identifying maximum chordal subgraphs, that reduces noise from biological correlation networks, thereby making it possible to find biologically relevant clusters from the filtered network. We show how selecting the appropriate filter …