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

Yassen Assenov

dblp:75/2399 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2018
0000-0002-6992-2092ORCID · corroborated

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

Applied, interdisciplinary, general and emerging computing · 2 · 1 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
2 papers
Bioinformatics and computational biology · 100%
Theoretical computer science
1 paper
Graph algorithms and graph theory · 100%

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology
epigenomics
0.312018
Enrichment analysis with EpiAnnotator · Bioinform. 2018
Bioinformatics and computational biology › functional genomics
functional enrichment analysis
0.312018
Enrichment analysis with EpiAnnotator · Bioinform. 2018
Bioinformatics and computational biology › network bioinformatics
biological network analysis
0.112008
Computing topological parameters of biological networks · Bioinform. 2008
Bioinformatics and computational biology › network bioinformatics › biological network analysis
network topology analysis
0.112008
Computing topological parameters of biological networks · Bioinform. 2008
Graph algorithms and graph theory › graph theory
graph parameters
0.012008
Computing topological parameters of biological networks · Bioinform. 2008

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

statistical enrichment testing · 0.3graph theory · 0.2
YearPublicationVenuePosition
2018 Enrichment analysis with EpiAnnotator
abstract
Motivation: Deciphering relevant biological insights from epigenomic data can be a challenging task. One commonly used approach is to perform enrichment analysis. However, finding, downloading and using the publicly available functional annotations require time, programming skills and IT infrastructure. Here we describe the online tool EpiAnnotator for performing enrichment analyses on epigenomic data in a fast and user-friendly way. Results: EpiAnnotator is an R Package accompanied by a web interface. It contains regularly updated annotations from 4 public databases: Blueprint, RoadMap, GENCODE and the UCSC Genome Browser. Annotations are hosted locally or in a server environment and automatically updated by scripts of our own design. Thousands of tracks are available, reflecting data on a variety of tissues, cell types and cell lines from the human and mouse genomes. Users need to upload sets of selected and background regions. Results are displayed in customizable and easily interpretable figures. Availability and implementation: The R package and Shiny app are open source and available under the GPL v3 license. EpiAnnotator's web interface is accessible at http://computational-epigenomics.com/en/epiannotator. Contact: [email protected].
Yoann Pageaud, Christoph Plass, Yassen Assenov
Bioinform.3
2008 Computing topological parameters of biological networks
abstract
UNLABELLED: Rapidly increasing amounts of molecular interaction data are being produced by various experimental techniques and computational prediction methods. In order to gain insight into the organization and structure of the resultant large complex networks formed by the interacting molecules, we have developed the versatile Cytoscape plugin NetworkAnalyzer. It computes and displays a comprehensive set of topological parameters, which includes the number of nodes, edges, and connected components, the network diameter, radius, density, centralization, heterogeneity, and clustering coefficient, the characteristic path length, and the distributions of node degrees, neighborhood connectivities, average clustering coefficients, and shortest path lengths. NetworkAnalyzer can be applied to both directed and undirected networks and also contains extra functionality to construct the intersection or union of two networks. It is an interactive and highly customizable application that requires no expert knowledge in graph theory from the user. AVAILABILITY: NetworkAnalyzer can be downloaded via the Cytoscape web site: http://www.cytoscape.org
Yassen Assenov, Fidel Ramírez, Sven-Eric Schelhorn, Thomas Lengauer, Mario Albrecht
Bioinform.1