Yuriy Hulovatyy

dblp:140/8212 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2016
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 2 · 2 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology
aging
0.212015
Exploring the structure and function of temporal networks with dynamic graphlets · Bioinform. 2015
Bioinformatics and computational biology › biological network
network biology
0.212015
Exploring the structure and function of temporal networks with dynamic graphlets · Bioinform. 2015
Bioinformatics and computational biology › protein analysis › protein-protein interaction
protein-protein interaction network
0.212015
Exploring the structure and function of temporal networks with dynamic graphlets · Bioinform. 2015

Methods — techniques the papers use, named apart from their topics

temporal motif analysis · 0.2graphlet analysis · 0.2
YearPublicationVenuePosition
2016 Exploring the structure and function of temporal networks with dynamic graphlets
abstract
Bioinformatics, (2015) 31(12): i171–i180 doi: 10.1093/bioinformatics/btv227 The authors wish to correct the following error in the above article: in the legend of figure 1, a sentence in the legend reads, ‘But there are two orbits in graphlet G2, as the two end nodes are topologically identical to each other but not to the middle node (and vice versa)’, this should be corrected to, ‘But there are two orbits in graphlet G1, as the two end nodes are topologically identical to each other but not to the middle node (and vice versa)’. The authors apologize for this error.
Yuriy Hulovatyy, Huili Chen, Tijana Milenkovic
Bioinform.1
2015 Exploring the structure and function of temporal networks with dynamic graphlets
abstract
MOTIVATION: With increasing availability of temporal real-world networks, how to efficiently study these data? One can model a temporal network as a single aggregate static network, or as a series of time-specific snapshots, each being an aggregate static network over the corresponding time window. Then, one can use established methods for static analysis on the resulting aggregate network(s), but losing in the process valuable temporal information either completely, or at the interface between different snapshots, respectively. Here, we develop a novel approach for studying a temporal network more explicitly, by capturing inter-snapshot relationships. RESULTS: We base our methodology on well-established graphlets (subgraphs), which have been proven in numerous contexts in static network research. We develop new theory to allow for graphlet-based analyses of temporal networks. Our new notion of dynamic graphlets is different from existing dynamic network approaches that are based on temporal motifs (statistically significant subgraphs). The latter have limitations: their results depend on the choice of a null network model that is required to evaluate the significance of a subgraph, and choosing a good null model is non-trivial. Our dynamic graphlets overcome the limitations of the temporal motifs. Also, when we aim to characterize the structure and function of an entire temporal network or of individual nodes, our dynamic graphlets outperform the static graphlets. Clearly, accounting for temporal information helps. We apply dynamic graphlets to temporal age-specific molecular network data to deepen our limited knowledge about human aging. AVAILABILITY AND IMPLEMENTATION: http://www.nd.edu/∼cone/DG.
Yuriy Hulovatyy, Huili Chen, Tijana Milenkovic
Bioinform.1