Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Mikhail Rotkevich

dblp:392/1177 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2024
—ORCID · unresolved

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

Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021

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%
Theoretical computer science
1 paper
Graph algorithms and graph theory · 50% Computational geometry · 50%

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › network bioinformatics
biological network analysis
0.812024
Graphlet-based hyperbolic embeddings capture evolutionary dynamics in genetic networks · Bioinform. 2024
Computational geometry › graph drawing
hyperbolic embedding
0.212024
Graphlet-based hyperbolic embeddings capture evolutionary dynamics in genetic networks · Bioinform. 2024
Graph algorithms and graph theory › graph embedding
network embedding
0.212024
Graphlet-based hyperbolic embeddings capture evolutionary dynamics in genetic networks · Bioinform. 2024

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

functional enrichment analysis · 1.5coalescent embedding · 1.5
YearPublicationVenuePosition
2024 Graphlet-based hyperbolic embeddings capture evolutionary dynamics in genetic networks
abstract
MOTIVATION: Spatial Analysis of Functional Enrichment (SAFE) is a popular tool for biologists to investigate the functional organization of biological networks via highly intuitive 2D functional maps. To create these maps, SAFE uses Spring embedding to project a given network into a 2D space in which nodes connected in the network are near each other in space. However, many biological networks are scale-free, containing highly connected hub nodes. Because Spring embedding fails to separate hub nodes, it provides uninformative embeddings that resemble a 'hairball'. In addition, Spring embedding only captures direct node connectivity in the network and does not consider higher-order node wiring patterns, which are best captured by graphlets, small, connected, nonisomorphic, induced subgraphs. The scale-free structure of biological networks is hypothesized to stem from an underlying low-dimensional hyperbolic geometry, which novel hyperbolic embedding methods try to uncover. These include coalescent embedding, which projects a network onto a 2D disk. RESULTS: To better capture the functional organization of scale-free biological networks, whilst also going beyond simple direct connectivity patterns, we introduce Graphlet Coalescent (GraCoal) embedding, which embeds nodes nearby on a disk if they frequently co-occur on a given graphlet together. We use GraCoal to extend SAFE-based network analysis. Through SAFE-enabled enrichment analysis, we show that GraCoal outperforms graphlet-based Spring embedding in capturing the functional organization of the genetic interaction networks of fruit fly, budding yeast, fission yeast and Escherichia coli. We show that depending on the underlying graphlet, GraCoal embeddings capture different topology-function relationships. We show that triangle-based GraCoal embedding captures functional redundancies between paralogs. AVAILABILITY AND IMPLEMENTATION: https://gitlab.bsc.es/swindels/gracoal_embedding.
Sam F. L. Windels, Daniel Tello Velasco, Mikhail Rotkevich, Noël Malod-Dognin, Natasa Przulj
Bioinform.3