Results 21 to 30 of about 157,967 (267)
Life, 2022 The 4D-Dynamic Representation of DNA/RNA Sequences, an alignment-free bioinformatics method recently developed by us, has been used to study the genetic diversity of Echinococcus multilocularis in red foxes in Poland.
Dorota Bielińska-Wąż +3 more
doaj +1 more source
Link Prediction Model for Dynamic Graphs [PDF]
Jisuanji kexue yu tansuo, 2022 In the real world, any complex relationships can be represented as graphs, such as communication networks, biological networks, recommendation systems, etc.
TANG Chen, ZHAO Jieyu, YE Xulun, ZHENG Yang, YU Shushi
doaj +1 more source
CoRR, 2015 Graph databases in many applications---semantic web, transport or biological networks among others---are not only large, but also frequently modified. Evaluating graph queries in this dynamic context is a challenging task, as those queries often combine first-order and navigational features.
Pablo Muñoz 0004 +2 more
openaire +4 more sources
Dynamic programming for graphs on surfaces [PDF]
ACM Transactions on Algorithms, 2010 We provide a framework for the design and analysis of dynamic programming algorithms for surface-embedded graphs onnvertices and branchwidth at mostk. Our technique applies to general families of problems where standard dynamic programming runs in 2O(k⋅logk)⋅nsteps.
Juanjo Rué +2 more
openaire +9 more sources
Node Similarity Top-k Query Method with Probabilistic Walk Constraint in Large-Scale Dynamic Graphs [PDF]
Jisuanji gongcheng, 2021 The existing large-scale dynamic graphs node similarity Top-k query methods for large-scale graphs are inefficient and fail to adaptively update the query results when the graph changes dynamically,which leads to a reduction in the accuracy of query ...
CHEN Ze, DING Linlin, SONG Baoyan, WANG Junlu
doaj +1 more source
Theoretical Computer Science, 2016 Does the interaction graph of a finite dynamical system can force this system to have a "complex" dynamics ? In other words, given a finite interval of integers $A$, which are the signed digraphs $G$ such that every finite dynamical system $f:A^n\to A^n$ with $G$ as interaction graph has a "complex" dynamics ?
Maximilien Gadouleau, Adrien Richard
openaire +4 more sources
Semi-Markov Graph Dynamics [PDF]
PLoS ONE, 2011 In this paper, we outline a model of graph (or network) dynamics based on two ingredients. The first ingredient is a Markov chain on the space of possible graphs. The second ingredient is a semi-Markov counting process of renewal type. The model consists in subordinating the Markov chain to the semi-Markov counting process.
RABERTO, MARCO +2 more
openaire +10 more sources
High-Level Synthesis of DSP Applications Using Adaptive Negative Cycle Detection
EURASIP Journal on Advances in Signal Processing, 2002 The problem of detecting negative weight cycles in a graph is examined in the context of the dynamic graph structures that arise in the process of high level synthesis (HLS).
Nitin Chandrachoodan +2 more
doaj +1 more source
Dynamic Balanced Graph Partitioning [PDF]
SIAM Journal on Discrete Mathematics, 2020 This paper initiates the study of the classic balanced graph partitioning problem from an online perspective: Given an arbitrary sequence of pairwise communication requests between $n$ nodes, with patterns that may change over time, the objective is to service these requests efficiently by partitioning the nodes into $\ell$ clusters, each of size $k ...
Chen Avin +4 more
openaire +3 more sources