Demo Data from EDBT 2026 / reviewers in the wild / expert
Igor Mandric
dblp:151/6269
· DBLP profile ↗
7ranked-venue papers
5as first author
0since 2021 · last 2020
0000-0003-4362-5169ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 7 · 5 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
5 papers |
Bioinformatics and computational biology · 100% | |
| Theoretical computer science
1 paper |
Graph algorithms and graph theory · 100% |
Topics — the 6 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology
genomics |
0.8 | 3 | 2018 | Repeat-aware evaluation of scaffolding tools · Bioinform. 2018 ScaffMatch: scaffolding algorithm based on maximum weight matching · Bioinform. 2015 ScaffMatch: Scaffolding Algorithm Based on Maximum Weight Matching · RECOMB 2015 |
Bioinformatics and computational biology › sequence analysis › sequence assembly
genome assembly |
0.5 | 2 | 2018 | Repeat-aware evaluation of scaffolding tools · Bioinform. 2018 ScaffMatch: scaffolding algorithm based on maximum weight matching · Bioinform. 2015 |
Bioinformatics and computational biology › sequence analysis › sequence assembly › genome assembly
scaffolding |
0.4 | 2 | 2015 | ScaffMatch: scaffolding algorithm based on maximum weight matching · Bioinform. 2015 ScaffMatch: Scaffolding Algorithm Based on Maximum Weight Matching · RECOMB 2015 |
Bioinformatics and computational biology › gene expression analysis
differential expression analysis |
0.3 | 1 | 2017 | Fast bootstrapping-based estimation of confidence intervals of expression levels and differential expression from RNA-Seq data · Bioinform. 2017 |
Bioinformatics and computational biology
transcriptomics |
0.3 | 1 | 2017 | Fast bootstrapping-based estimation of confidence intervals of expression levels and differential expression from RNA-Seq data · Bioinform. 2017 |
Graph algorithms and graph theory › graph matching
maximum matching |
0.2 | 1 | 2015 | ScaffMatch: Scaffolding Algorithm Based on Maximum Weight Matching · RECOMB 2015 |
Methods — techniques the papers use, named apart from their topics
maximum weight matching · 1.0scalable algorithm · 0.3phylogenetic analysis · 0.3bayesian inference · 0.3confidence interval estimation · 0.3bootstrapping · 0.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2020 | Estimating Enzyme Participation in Metabolic Pathways for Microbial Communities from RNA-seq Data
Filipp Rondel, Roya Hosseini 0002, Bikram Sahoo, Sergey Knyazev, Igor Mandric, Frank Stewart, Ion I. Mandoiu, Bogdan Pasaniuc, Alex Zelikovsky |
ISBRA | 5 |
| 2018 | Repeat-aware evaluation of scaffolding toolsabstractSummary: Genomic sequences are assembled into a variable, but large number of contigs that should be scaffolded (ordered and oriented) for facilitating comparative or functional analysis. Finding scaffolding is computationally challenging due to misassemblies, inconsistent coverage across the genome and long repeats. An accurate assessment of scaffolding tools should take into account multiple locations of the same contig on the reference scaffolding rather than matching a repeat to a single best location. This makes mapping of inferred scaffoldings onto the reference a computationally challenging problem. This paper formulates the repeat-aware scaffolding evaluation problem, which is to find a mapping of the inferred scaffolding onto the reference maximizing number of correct links and proposes a scalable algorithm capable of handling large whole-genome datasets. Our novel scaffolding validation framework has been applied to assess the most of state-of-the-art scaffolding tools on the representative subset of Genome Assembly Golden-Standard Evaluations (GAGE) datasets and some novel simulated datasets. Availability and implementation: The source code of this evaluation framework is available at https://github.com/mandricigor/repeat-aware. The documentation is hosted at https://mandricigor.github.io/repeat-aware. Supplementary information: Supplementary data are available at Bioinformatics online. Igor Mandric, Sergey Knyazev, Alex Zelikovsky |
Bioinform. | 1 |
| 2018 | QUENTIN: reconstruction of disease transmissions from viral quasispecies genomic dataabstractMotivation: Genomic analysis has become one of the major tools for disease outbreak investigations. However, existing computational frameworks for inference of transmission history from viral genomic data often do not consider intra-host diversity of pathogens and heavily rely on additional epidemiological data, such as sampling times and exposure intervals. This impedes genomic analysis of outbreaks of highly mutable viruses associated with chronic infections, such as human immunodeficiency virus and hepatitis C virus, whose transmissions are often carried out through minor intra-host variants, while the additional epidemiological information often is either unavailable or has a limited use. Results: The proposed framework QUasispecies Evolution, Network-based Transmission INference (QUENTIN) addresses the above challenges by evolutionary analysis of intra-host viral populations sampled by deep sequencing and Bayesian inference using general properties of social networks relevant to infection dissemination. This method allows inference of transmission direction even without the supporting case-specific epidemiological information, identify transmission clusters and reconstruct transmission history. QUENTIN was validated on experimental and simulated data, and applied to investigate HCV transmission within a community of hosts with high-risk behavior. It is available at https://github.com/skumsp/QUENTIN. Contact: [email protected] or [email protected] or [email protected] or [email protected]. Supplementary information: Supplementary data are available at Bioinformatics online. Pavel Skums, Alex Zelikovsky, Walker Gussler, Zoya Dimitrova, Sergey Knyazev, Igor Mandric, Sumathi Ramachandran, David S. Campo, Deeptanshu Jha, Leonid A. Bunimovich, Elizabeth Costenbader, Connie Sexton, Siobhán O'Connor 0002, Guo-liang Xia, Yuri Khudyakov |
Bioinform. | 7 |
| 2017 | Metabolic Analysis of Metatranscriptomic Data from Planktonic Communities
Igor Mandric, Sergey Knyazev, Cory Padilla, Frank Stewart, Ion I. Mandoiu, Alex Zelikovsky |
ISBRA | 1 |
| 2017 | Fast bootstrapping-based estimation of confidence intervals of expression levels and differential expression from RNA-Seq dataabstractSUMMARY: This note presents IsoEM2 and IsoDE2, new versions with enhanced features and faster runtime of the IsoEM and IsoDE packages for expression level estimation and differential expression. IsoEM2 estimates fragments per kilobase million (FPKM) and transcript per million (TPM) levels for genes and isoforms with confidence intervals through bootstrapping, while IsoDE2 performs differential expression analysis using the bootstrap samples generated by IsoEM2. Both tools are available with a command line interface as well as a graphical user interface (GUI) through wrappers for the Galaxy platform. AVAILABILITY AND IMPLEMENTATION: The source code of this software suite is available at https://github.com/mandricigor/isoem2. The Galaxy wrappers are available at https://toolshed.g2.bx.psu.edu/view/saharlcc/isoem2_isode2/. CONTACT: [email protected] or [email protected]. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online. Igor Mandric, Yvette Temate-Tiagueu, Tatiana Shcheglova, Sahar Al Seesi, Alex Zelikovsky, Ion I. Mandoiu |
Bioinform. | 1 |
| 2015 | ScaffMatch: Scaffolding Algorithm Based on Maximum Weight Matching
Igor Mandric, Alex Zelikovsky |
RECOMB | 1 |
| 2015 | ScaffMatch: scaffolding algorithm based on maximum weight matchingabstractMOTIVATION: Next-generation high-throughput sequencing has become a state-of-the-art technique in genome assembly. Scaffolding is one of the main stages of the assembly pipeline. During this stage, contigs assembled from the paired-end reads are merged into bigger chains called scaffolds. Because of a high level of statistical noise, chimeric reads, and genome repeats the problem of scaffolding is a challenging task. Current scaffolding software packages widely vary in their quality and are highly dependent on the read data quality and genome complexity. There are no clear winners and multiple opportunities for further improvements of the tools still exist. RESULTS: This article presents an efficient scaffolding algorithm ScaffMatch that is able to handle reads with both short (<600 bp) and long (>35 000 bp) insert sizes producing high-quality scaffolds. We evaluate our scaffolding tool with the F score and other metrics (N50, corrected N50) on eight datasets comparing it with the most available packages. Our experiments show that ScaffMatch is the tool of preference for the most datasets. AVAILABILITY AND IMPLEMENTATION: The source code is available at http://alan.cs.gsu.edu/NGS/?q=content/scaffmatch. CONTACT: [email protected] SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online. Igor Mandric, Alex Zelikovsky |
Bioinform. | 1 |