Demo Data from VLDB 2026 / reviewers in the wild / expert
Shahab Sarmashghi
dblp:225/8961
· DBLP profile ↗
5ranked-venue papers
3as first author
2since 2021 · last 2022
0000-0003-0564-1643ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 5 · 3 first-author · 2 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
4 papers |
Bioinformatics and computational biology · 79% Computational science and engineering · 21% | |
| 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
phylogenetics |
1.0 | 2 | 2022 | Uncertainty Quantification Using Subsampling for Assembly-Free Estimates of Genomic Distance and Phylogenetic Relationships · RECOMB 2022 APPLES: Fast Distance-Based Phylogenetic Placement · RECOMB 2019 |
Computational science and engineering
uncertainty quantification |
0.6 | 1 | 2022 | Uncertainty Quantification Using Subsampling for Assembly-Free Estimates of Genomic Distance and Phylogenetic Relationships · RECOMB 2022 |
Bioinformatics and computational biology › genomics
genomic interval analysis |
0.4 | 1 | 2019 | A Note on Computing Interval Overlap Statistics · RECOMB 2019 |
Bioinformatics and computational biology › phylogenetics › phylogenetic inference
phylogenetic placement |
0.4 | 1 | 2019 | APPLES: Fast Distance-Based Phylogenetic Placement · RECOMB 2019 |
Graph algorithms and graph theory
graph algorithms |
0.4 | 1 | 2019 | APPLES: Fast Distance-Based Phylogenetic Placement · RECOMB 2019 |
Bioinformatics and computational biology › comparative genomics › genome comparison
genome distance estimation |
0.2 | 1 | 2022 | Uncertainty Quantification Using Subsampling for Assembly-Free Estimates of Genomic Distance and Phylogenetic Relationships · RECOMB 2022 |
Methods — techniques the papers use, named apart from their topics
distance-based phylogenetic placement · 0.8uncertainty quantification · 0.6subsampling · 0.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | Uncertainty Quantification Using Subsampling for Assembly-Free Estimates of Genomic Distance and Phylogenetic Relationships
Eleonora Rachtman, Shahab Sarmashghi, Vineet Bafna, Siavash Mirarab |
RECOMB | 2 |
| 2021 | Estimating repeat spectra and genome length from low-coverage genome skims with RESPECTabstractThe cost of sequencing the genome is dropping at a much faster rate compared to assembling and finishing the genome. The use of lightly sampled genomes (genome-skims) could be transformative for genomic ecology, and results using k-mers have shown the advantage of this approach in identification and phylogenetic placement of eukaryotic species. Here, we revisit the basic question of estimating genomic parameters such as genome length, coverage, and repeat structure, focusing specifically on estimating the k-mer repeat spectrum. We show using a mix of theoretical and empirical analysis that there are fundamental limitations to estimating the k-mer spectra due to ill-conditioned systems, and that has implications for other genomic parameters. We get around this problem using a novel constrained optimization approach (Spline Linear Programming), where the constraints are learned empirically. On reads simulated at 1X coverage from 66 genomes, our method, REPeat SPECTra Estimation (RESPECT), had 2.2% error in length estimation compared to 27% error previously achieved. In shotgun sequenced read samples with contaminants, RESPECT length estimates had median error 4%, in contrast to other methods that had median error 80%. Together, the results suggest that low-pass genomic sequencing can yield reliable estimates of the length and repeat content of the genome. The RESPECT software will be publicly available at https://urldefense.proofpoint.com/v2/url?u=https-3A__github.com_shahab-2Dsarmashghi_RESPECT.git&d=DwIGAw&c=-35OiAkTchMrZOngvJPOeA&r=ZozViWvD1E8PorCkfwYKYQMVKFoEcqLFm4Tg49XnPcA&m=f-xS8GMHKckknkc7Xpp8FJYw_ltUwz5frOw1a5pJ81EpdTOK8xhbYmrN4ZxniM96&s=717o8hLR1JmHFpRPSWG6xdUQTikyUjicjkipjFsKG4w&e=. Shahab Sarmashghi, Metin Balaban, Eleonora Rachtman, Behrouz Touri, Siavash Mirarab, Vineet Bafna |
PLoS Comput. Biol. | 1 |
| 2019 | APPLES: Fast Distance-Based Phylogenetic Placement
Metin Balaban, Shahab Sarmashghi, Siavash Mirarab |
RECOMB | 2 |
| 2019 | A Note on Computing Interval Overlap Statistics
Shahab Sarmashghi, Vineet Bafna |
RECOMB | 1 |
| 2018 | Assembly-Free and Alignment-Free Sample Identification Using Genome Skims
Shahab Sarmashghi, Kristine Bohmann, M. Thomas P. Gilbert, Vineet Bafna, Siavash Mirarab |
RECOMB | 1 |