Demo Data from EDBT 2026 / reviewers in the wild / expert
Aniket C. Mane
dblp:160/4420
· DBLP profile ↗
4ranked-venue papers
2as first author
3since 2021 · last 2026
0000-0002-0130-7149ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 3 · 2 first-author · 3 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.
| 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
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology › sequence analysis › sequence assembly
assembly graph analysis |
0.7 | 1 | 2023 | PlasBin-flow: a flow-based MILP algorithm for plasmid contigs binning · Bioinform. 2023 |
Bioinformatics and computational biology › sequence analysis › sequence assembly
genome assembly |
0.7 | 1 | 2023 | PlasBin-flow: a flow-based MILP algorithm for plasmid contigs binning · Bioinform. 2023 |
Bioinformatics and computational biology
genomics |
0.7 | 1 | 2023 | PlasBin-flow: a flow-based MILP algorithm for plasmid contigs binning · Bioinform. 2023 |
Methods — techniques the papers use, named apart from their topics
network flow · 0.7mixed integer linear programming · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | On using clustering statistics for assessing plasmid binning tools accuracyabstractWe discuss the drawbacks of using homogeneity and completeness, statistics defined for the evaluation of clustering accuracy, for evaluating plasmid binning tools accuracy, motivated by the recently published paper "Circling in on plasmids: benchmarking plasmid detection and reconstruction tools for short-read data from diverse species," by Teixeira et al. Victor Epain, Aniket C. Mane, Cédric Chauve |
Briefings Bioinform. | 2 |
| 2024 | Plaseval: a framework for comparing and evaluating plasmid detection toolsabstractBACKGROUND: Plasmids play a major role in the transfer of antimicrobial resistance (AMR) genes among bacteria via horizontal gene transfer. The identification of plasmids in short-read assemblies is a challenging problem and a very active research area. Plasmid binning aims at detecting, in a draft genome assembly, groups (bins) of contigs likely to originate from the same plasmid. Several methods for plasmid binning have been developed recently, such as PlasBin-flow, HyAsP, gplas, MOB-suite, and plasmidSPAdes. This motivates the problem of evaluating the performances of plasmid binning methods, either against a given ground truth or between them. RESULTS: We describe PlasEval, a novel method aimed at comparing the results of plasmid binning tools. PlasEval computes a dissimilarity measure between two sets of plasmid bins, that can originate either from two plasmid binning tools, or from a plasmid binning tool and a ground truth set of plasmid bins. The PlasEval dissimilarity accounts for the contig content of plasmid bins, the length of contigs and is repeat-aware. Moreover, the dissimilarity score computed by PlasEval is broken down into several parts, that allows to understand qualitative differences between the compared sets of plasmid bins. We illustrate the use of PlasEval by benchmarking four recently developed plasmid binning tools-PlasBin-flow, HyAsP, gplas, and MOB-recon-on a data set of 53 E. coli bacterial genomes. CONCLUSION: Analysis of the results of plasmid binning methods using PlasEval shows that their behaviour varies significantly. PlasEval can be used to decide which specific plasmid binning method should be used for a specific dataset. The disagreement between different methods also suggests that the problem of plasmid binning on short-read contigs requires further research. We believe that PlasEval can prove to be an effective tool in this regard. PlasEval is publicly available at https://github.com/acme92/PlasEval. Aniket C. Mane, Haley Sanderson, Aaron P. White, Rahat Zaheer, Robert Beiko, Cédric Chauve |
BMC Bioinform. | 1 |
| 2023 | PlasBin-flow: a flow-based MILP algorithm for plasmid contigs binningabstractMOTIVATION: The analysis of bacterial isolates to detect plasmids is important due to their role in the propagation of antimicrobial resistance. In short-read sequence assemblies, both plasmids and bacterial chromosomes are typically split into several contigs of various lengths, making identification of plasmids a challenging problem. In plasmid contig binning, the goal is to distinguish short-read assembly contigs based on their origin into plasmid and chromosomal contigs and subsequently sort plasmid contigs into bins, each bin corresponding to a single plasmid. Previous works on this problem consist of de novo approaches and reference-based approaches. De novo methods rely on contig features such as length, circularity, read coverage, or GC content. Reference-based approaches compare contigs to databases of known plasmids or plasmid markers from finished bacterial genomes. RESULTS: Recent developments suggest that leveraging information contained in the assembly graph improves the accuracy of plasmid binning. We present PlasBin-flow, a hybrid method that defines contig bins as subgraphs of the assembly graph. PlasBin-flow identifies such plasmid subgraphs through a mixed integer linear programming model that relies on the concept of network flow to account for sequencing coverage, while also accounting for the presence of plasmid genes and the GC content that often distinguishes plasmids from chromosomes. We demonstrate the performance of PlasBin-flow on a real dataset of bacterial samples. AVAILABILITY AND IMPLEMENTATION: https://github.com/cchauve/PlasBin-flow. Aniket C. Mane, Mahsa Faizrahnemoon, Tomás Vinar, Brona Brejová, Cédric Chauve |
Bioinform. | 1 |
| 2015 | Computational complexity of minimum P4 vertex cover problem for regular and K1, 4-free graphs
N. Safina Devi, Aniket C. Mane, Sounaka Mishra |
Discret. Appl. Math. | 2 |