scholarly journals Hybrid algorithms for subgraph pattern queries in graph databases

2017 ◽  
Author(s):  
Foteini Katsarou ◽  
Nikos Ntarmos ◽  
Peter Triantafillou
Keyword(s):  
Hybrid Algorithms ◽  
Graph Databases ◽  
Subgraph Pattern

Character Reorganization and Categorization using Hybrid Algorithms by Scanned Documents

2019 ◽  
Vol 8 (6S2) ◽  
pp. 943-948
Keyword(s):  
Research Work ◽  
Hybrid Algorithms ◽  
Research Topic ◽  
Image Processing Techniques ◽  
Digital Books ◽  
Otsu Method ◽  
Challenging Research ◽  
Processing Techniques ◽  
Scanned Documents ◽  
Day By Day

Detection and reorganization of text may save a lot of time while reproducing old books text and its chapters. This is really challenging research topic as different books may have different font types and styles. The digital books and eBooks reading habit is increasing day by day and new documents are producing every day. So in order to boost the process the text reorganization using digital image processing techniques can be used. This research work is using hybrid algorithms and morphological algorithms. For sample we have taken an letter pad where the text and images are separated using algorithms. The another objective of this research is to increase the accuracy of recognized text and produce accurate results. This research worked on two different concepts, first is concept of Pixel-level thresholding processing and another one is Otsu Method thresholding.

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.

scholarly journals Understanding the graph databases and power grid systems

2018 ◽  
Vol 439 ◽  
pp. 032110 ◽  
Author(s):  
Xuming Lv ◽  
Shuo Chen ◽  
Shanqi Zheng ◽  
Jingzhao Luan ◽  
Yonghui Guo
Keyword(s):  
Power Grid ◽  
Graph Databases ◽  
Grid Systems

scholarly journals Efficient Access Methods for Very Large Distributed Graph Databases

2021 ◽  
Author(s):  
David Luaces ◽  
José R.R. Viqueira ◽  
José M. Cotos ◽  
Julián C. Flores
Keyword(s):  
Graph Databases ◽  
Access Methods ◽  
Efficient Access

Data Profiling in Property Graph Databases

2020 ◽  
Vol 12 (4) ◽  
pp. 1-27
Author(s):  
Sofía Maiolo ◽  
Lorena Etcheverry ◽  
Adriana Marotta
Keyword(s):  
Graph Databases ◽  
Data Profiling

scholarly journals Synthesizing Multi-Layer Perceptron Network with Ant Lion Biogeography-Based Dragonfly Algorithm Evolutionary Strategy Invasive Weed and League Champion Optimization Hybrid Algorithms in Predicting Heating Load in Residential Buildings

2021 ◽  
Vol 13 (6) ◽  
pp. 3198
Author(s):  
Hossein Moayedi ◽  
Amir Mosavi
Keyword(s):  
Residential Buildings ◽  
Optimization Technique ◽  
Hybrid Algorithms ◽  
Evolutionary Strategy ◽  
Multi Layer Perceptron ◽  
Invasive Weed ◽  
Dragonfly Algorithm ◽  
Ant Lion Optimization ◽  
Heating Load ◽  
Ant Lion

The significance of accurate heating load (HL) approximation is the primary motivation of this research to distinguish the most efficient predictive model among several neural-metaheuristic models. The proposed models are formulated through synthesizing a multi-layer perceptron network (MLP) with ant lion optimization (ALO), biogeography-based optimization (BBO), the dragonfly algorithm (DA), evolutionary strategy (ES), invasive weed optimization (IWO), and league champion optimization (LCA) hybrid algorithms. Each ensemble is optimized in terms of the operating population. Accordingly, the ALO-MLP, BBO-MLP, DA-MLP, ES-MLP, IWO-MLP, and LCA-MLP presented their best performance for population sizes of 350, 400, 200, 500, 50, and 300, respectively. The comparison was carried out by implementing a ranking system. Based on the obtained overall scores (OSs), the BBO (OS = 36) featured as the most capable optimization technique, followed by ALO (OS = 27) and ES (OS = 20). Due to the efficient performance of these algorithms, the corresponding MLPs can be promising substitutes for traditional methods used for HL analysis.

Sign in / Sign up

Export Citation Format

Share Document