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

Venetia Pliatsika

dblp:184/4830 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
2since 2021 · last 2025
0009-0000-7462-6688ORCID · corroborated

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

Applied, interdisciplinary, general and emerging computing · 2 · 1 first-author · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 1 since 2021Theory of computation · 1

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.

Artificial intelligence
1 paper
Trustworthy machine learning · 100%
Interdisciplinary, comprehensive, and emerging computing
2 papers
Bioinformatics and computational biology · 100%
Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning
interpretability
0.912025
ShaRP: Explaining Rankings and Preferences with Shapley Values · Proc. VLDB Endow. 2025
Machine learning › Trustworthy machine learning › interpretability › shapley value
shapley value explanation
0.912025
ShaRP: Explaining Rankings and Preferences with Shapley Values · Proc. VLDB Endow. 2025
Information retrieval › ranking › ranking model
interpretable ranking
0.912025
ShaRP: Explaining Rankings and Preferences with Shapley Values · Proc. VLDB Endow. 2025
Bioinformatics and computational biology › sequence analysis › RNA sequence analysis
microRNA analysis
0.512021
IsoMiRmap: fast, deterministic and exhaustive mining of isomiRs from short RNA-seq datasets · Bioinform. 2021
Bioinformatics and computational biology
transcriptomics
0.512021
IsoMiRmap: fast, deterministic and exhaustive mining of isomiRs from short RNA-seq datasets · Bioinform. 2021
Bioinformatics and computational biology › knowledge representation in biology
biological database and knowledge base
0.212016
MINTbase: a framework for the interactive exploration of mitochondrial and nuclear tRNA fragments · Bioinform. 2016
Bioinformatics and computational biology › transcriptomics
non-coding RNA analysis
0.212016
MINTbase: a framework for the interactive exploration of mitochondrial and nuclear tRNA fragments · Bioinform. 2016
Bioinformatics and computational biology › transcriptomics
RNA-seq analysis
0.112021
IsoMiRmap: fast, deterministic and exhaustive mining of isomiRs from short RNA-seq datasets · Bioinform. 2021

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

shapley value · 1.7learning to rank · 1.7short RNA-seq processing · 0.5deterministic sequence matching · 0.5genomic location enumeration · 0.2
YearPublicationVenuePosition
2025 ShaRP: Explaining Rankings and Preferences with Shapley Values
abstract
Algorithmic decisions in critical domains such as hiring, college admissions, and lending are often based on rankings. Given the impact of these decisions on individuals, organizations, and population groups, it is essential to understand them—to help individuals improve their ranking position, design better ranking procedures, and ensure legal compliance. In this paper, we argue that explainability methods for classification and regression, such as SHAP, are insufficient for ranking tasks, and present ShaRP—Shapley Values for Rankings and Preferences—a framework that explains the contributions of features to various aspects of a ranked outcome. ShaRP computes feature contributions for various ranking-specific profit functions, such as rank and top- k , and also includes a novel Shapley value-based method for explaining pairwise preference outcomes. We provide a flexible implementation of ShaRP, capable of efficiently and comprehensively explaining ranked and pairwise outcomes over tabular data, in score-based ranking and learning-to-rank tasks. Finally, we develop a comprehensive evaluation methodology for ranking explainability methods, showing through qualitative, quantitative, and usability studies that our rank-aware QoIs offer complementary insights, scale effectively, and help users interpret ranked outcomes in practice.
Venetia Pliatsika, João Fonseca, Kateryna Akhynko, Ivan Shevchenko, Julia Stoyanovich
Proc. VLDB Endow.1
2021 IsoMiRmap: fast, deterministic and exhaustive mining of isomiRs from short RNA-seq datasets
abstract
MOTIVATION: MicroRNA (miRNA) precursor arms give rise to multiple isoforms simultaneously called 'isomiRs.' IsomiRs from the same arm typically differ by a few nucleotides at either their 5' or 3' termini or both. In humans, the identities and abundances of isomiRs depend on a person's sex and genetic ancestry as well as on tissue type, tissue state and disease type/subtype. Moreover, nearly half of the time the most abundant isomiR differs from the miRNA sequence found in public databases. Accurate mining of isomiRs from deep sequencing data is thus important. RESULTS: We developed isoMiRmap, a fast, standalone, user-friendly mining tool that identifies and quantifies all isomiRs by directly processing short RNA-seq datasets. IsoMiRmap is a portable 'plug-and-play' tool, requires minimal setup, has modest computing and storage requirements, and can process an RNA-seq dataset with 50 million reads in just a few minutes on an average laptop. IsoMiRmap deterministically and exhaustively reports all isomiRs in a given deep sequencing dataset and quantifies them accurately (no double-counting). IsoMiRmap comprehensively reports all miRNA precursor locations from which an isomiR may be transcribed, tags as 'ambiguous' isomiRs whose sequences exist both inside and outside of the space of known miRNA sequences and reports the public identifiers of common single-nucleotide polymorphisms and documented somatic mutations that may be present in an isomiR. IsoMiRmap also identifies isomiRs with 3' non-templated post-transcriptional additions. Compared to similar tools, isoMiRmap is the fastest, reports more bona fide isomiRs, and provides the most comprehensive information related to an isomiR's transcriptional origin. AVAILABILITY AND IMPLEMENTATION: The codes for isoMiRmap are freely available at https://cm.jefferson.edu/isoMiRmap/ and https://github.com/TJU-CMC-Org/isoMiRmap/. IsomiR profiles for the datasets of the 1000 Genomes Project, spanning five population groups, and The Cancer Genome Atlas (TCGA), spanning 33 cancer studies, are also available at https://cm.jefferson.edu/isoMiRmap/. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Phillipe Loher, Nestoras Karathanasis, Eric Londin, Paul F. Bray, Venetia Pliatsika, Aristeidis G. Telonis, Isidore Rigoutsos
Bioinform.5
2017 Profit Sharing and Efficiency in Utility Games
abstract
We study utility games (Vetta, FOCS 2002) where a set of players join teams to produce social utility, and receive individual utility in the form of payments in return. These games have many natural applications in competitive settings such as labor markets, crowdsourcing, etc. The efficiency of such a game depends on the profit sharing mechanism - the rule that maps utility produced by the players to their individual payments. We study three natural and widely used profit sharing mechanisms - egalitarian or equal sharing, marginal gain or value addition when a player joins, and marginal loss or value depletion when a player leaves. For these settings, we give tight bounds on the price of anarchy, thereby allowing comparison between these popular mechanisms from a (worst case) social welfare perspective.
Sreenivas Gollapudi, Kostas Kollias, Debmalya Panigrahi, Venetia Pliatsika
ESA4
2016 MINTbase: a framework for the interactive exploration of mitochondrial and nuclear tRNA fragments
abstract
MOTIVATION: It has been known that mature transfer RNAs (tRNAs) that are encoded in the nuclear genome give rise to short molecules, collectively known as tRNA fragments or tRFs. Recently, we reported that, in healthy individuals and in patients, tRFs are constitutive, arise from mitochondrial as well as from nuclear tRNAs, and have composition and abundances that depend on a person's sex, population origin and race as well as on tissue, disease and disease subtype. Our findings as well as similar work by other groups highlight the importance of tRFs and presage an increase in the community's interest in elucidating the roles of tRFs in health and disease. RESULTS: We created MINTbase, a web-based framework that serves the dual-purpose of being a content repository for tRFs and a tool for the interactive exploration of these newly discovered molecules. A key feature of MINTbase is that it deterministically and exhaustively enumerates all possible genomic locations where a sequence fragment can be found and indicates which fragments are exclusive to tRNA space, and thus can be considered as tRFs: this is a very important consideration given that the genomes of higher organisms are riddled with partial tRNA sequences and with tRNA-lookalikes whose aberrant transcripts can be mistaken for tRFs. MINTbase is extremely flexible and integrates and presents tRF information from multiple yet interconnected vantage points ('vistas'). Vistas permit the user to interactively personalize the information that is returned and the manner in which it is displayed. MINTbase can report comparative information on how a tRF is distributed across all anticodon/amino acid combinations, provides alignments between a tRNA and multiple tRFs with which the user can interact, provides details on published studies that reported a tRF as expressed, etc. Importantly, we designed MINTbase to contain all possible tRFs that could ever be produced by mature tRNAs: this allows us to report on their genomic distributions, anticodon/amino acid properties, alignments, etc. while giving users the ability to at-will investigate candidate tRF molecules before embarking on focused experimental explorations. Lastly, we also introduce a new labeling scheme that is tRF-sequence-based and allows users to associate a tRF with a universally unique label ('tRF-license plate') that is independent of a genome assembly and does not require any brokering mechanism. AVAILABILITY AND IMPLEMENTATION: MINTbase is freely accessible at http://cm.jefferson.edu/MINTbase/. Dataset submissions to MINTbase can be initiated at http://cm.jefferson.edu/MINTsubmit/ CONTACT: [email protected] SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Venetia Pliatsika, Phillipe Loher, Aristeidis G. Telonis, Isidore Rigoutsos
Bioinform.1