Implementation of GRAC algorithm (Graph Algorithm Clustering) in graph database compression

2015 ◽  
Author(s):  
I Gusti Bagus Ady Sutrisna ◽  
W Kemas Rahmat Saleh ◽  
Alfian Akbar Gozali
Keyword(s):  
Graph Algorithm ◽  
Graph Database ◽  
Database Compression

Hydraulic model of a water cooling system in a chemical plant

1988 ◽  
Vol 53 (4) ◽  
pp. 788-806
Author(s):  
Miloslav Hošťálek ◽  
Jiří Výborný ◽  
František Madron
Keyword(s):  
Flow Rate ◽  
Cooling System ◽  
Cooling Water ◽  
Graph Algorithm ◽  
Automatic Generation ◽  
Hydraulic Calculation ◽  
Return Flow ◽  
Flow Rates ◽  
Pressure Losses ◽  
Controlled Flow

Steady state hydraulic calculation has been described of an extensive pipeline network based on a new graph algorithm for setting up and decomposition of balance equations of the model. The parameters of the model are characteristics of individual sections of the network (pumps, pipes, and heat exchangers with armatures). In case of sections with controlled flow rate (variable characteristic), or sections with measured flow rate, the flow rates are direct inputs. The interactions of the network with the surroundings are accounted for by appropriate sources and sinks of individual nodes. The result of the calculation is the knowledge of all flow rates and pressure losses in the network. Automatic generation of the model equations utilizes an efficient (vector) fixing of the network topology and predominantly logical, not numerical operations based on the graph theory. The calculation proper utilizes a modification of the model by the method of linearization of characteristics, while the properties of the modified set of equations permit further decrease of the requirements on the computer. The described approach is suitable for the solution of practical problems even on lower category personal computers. The calculations are illustrated on an example of a simple network with uncontrolled and controlled flow rates of cooling water while one of the sections of the network is also a gravitational return flow of the cooling water.

scholarly journals Advantages of using graph databases to explore chromatin conformation capture experiments

2021 ◽  
Vol 22 (S2) ◽  
Author(s):  
Daniele D’Agostino ◽  
Pietro Liò ◽  
Marco Aldinucci ◽  
Ivan Merelli
Keyword(s):  
Web Application ◽  
High Throughput Sequencing ◽  
Cell Types ◽  
Graph Database ◽  
Graph Databases ◽  
Sources Of Information ◽  
Chromosome Conformation ◽  
Wide Scale ◽  
User Friendly ◽  
Different Cell Types

Abstract Background High-throughput sequencing Chromosome Conformation Capture (Hi-C) allows the study of DNA interactions and 3D chromosome folding at the genome-wide scale. Usually, these data are represented as matrices describing the binary contacts among the different chromosome regions. On the other hand, a graph-based representation can be advantageous to describe the complex topology achieved by the DNA in the nucleus of eukaryotic cells. Methods Here we discuss the use of a graph database for storing and analysing data achieved by performing Hi-C experiments. The main issue is the size of the produced data and, working with a graph-based representation, the consequent necessity of adequately managing a large number of edges (contacts) connecting nodes (genes), which represents the sources of information. For this, currently available graph visualisation tools and libraries fall short with Hi-C data. The use of graph databases, instead, supports both the analysis and the visualisation of the spatial pattern present in Hi-C data, in particular for comparing different experiments or for re-mapping omics data in a space-aware context efficiently. In particular, the possibility of describing graphs through statistical indicators and, even more, the capability of correlating them through statistical distributions allows highlighting similarities and differences among different Hi-C experiments, in different cell conditions or different cell types. Results These concepts have been implemented in NeoHiC, an open-source and user-friendly web application for the progressive visualisation and analysis of Hi-C networks based on the use of the Neo4j graph database (version 3.5). Conclusion With the accumulation of more experiments, the tool will provide invaluable support to compare neighbours of genes across experiments and conditions, helping in highlighting changes in functional domains and identifying new co-organised genomic compartments.

scholarly journals Applying graph database technology for analyzing perturbed co-expression networks in cancer

Database ◽  
2020 ◽  
Vol 2020 ◽  
Author(s):  
Claire M Simpson ◽  
Florian Gnad
Keyword(s):  
Relational Databases ◽  
Molecular Mechanisms ◽  
Biological Data ◽  
Database Management System ◽  
Graph Database ◽  
Graph Databases ◽  
Graph Representations ◽  
Rnaseq Data ◽  
Database Technology ◽  
Speed Accuracy

Abstract Graph representations provide an elegant solution to capture and analyze complex molecular mechanisms in the cell. Co-expression networks are undirected graph representations of transcriptional co-behavior indicating (co-)regulations, functional modules or even physical interactions between the corresponding gene products. The growing avalanche of available RNA sequencing (RNAseq) data fuels the construction of such networks, which are usually stored in relational databases like most other biological data. Inferring linkage by recursive multiple-join statements, however, is computationally expensive and complex to design in relational databases. In contrast, graph databases store and represent complex interconnected data as nodes, edges and properties, making it fast and intuitive to query and analyze relationships. While graph-based database technologies are on their way from a fringe domain to going mainstream, there are only a few studies reporting their application to biological data. We used the graph database management system Neo4j to store and analyze co-expression networks derived from RNAseq data from The Cancer Genome Atlas. Comparing co-expression in tumors versus healthy tissues in six cancer types revealed significant perturbation tracing back to erroneous or rewired gene regulation. Applying centrality, community detection and pathfinding graph algorithms uncovered the destruction or creation of central nodes, modules and relationships in co-expression networks of tumors. Given the speed, accuracy and straightforwardness of managing these densely connected networks, we conclude that graph databases are ready for entering the arena of biological data.

Sign in / Sign up

Export Citation Format

Share Document