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

Rebecca Elyanow

dblp:212/0293 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 2020
0000-0001-8877-7188ORCID · corroborated

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

Applied, interdisciplinary, general and emerging computing · 3 · 2 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
3 papers
Bioinformatics and computational biology · 60% Computational science and engineering · 40%
Artificial intelligence
1 paper
Probabilistic and Bayesian machine learning · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › structured models › latent variable model
mixture model
0.412020
NetMix: A Network-Structured Mixture Model for Reduced-Bias Estimation of Altered Subnetworks · RECOMB 2020
Computational science and engineering › latent variable model
mixture model
0.412020
NetMix: A Network-Structured Mixture Model for Reduced-Bias Estimation of Altered Subnetworks · RECOMB 2020
Bioinformatics and computational biology › biological network
network biology
0.412020
NetMix: A Network-Structured Mixture Model for Reduced-Bias Estimation of Altered Subnetworks · RECOMB 2020
Computational science and engineering › statistical computing
data imputation
0.412019
netNMF-sc: A Network Regularization Algorithm for Dimensionality Reduction and Imputation of Single-Cell Expression Data · RECOMB 2019
Bioinformatics and computational biology › single-cell analysis
single-cell transcriptomics
0.412019
netNMF-sc: A Network Regularization Algorithm for Dimensionality Reduction and Imputation of Single-Cell Expression Data · RECOMB 2019
Bioinformatics and computational biology › genomics › structural variation
structural variant detection
0.312018
Identifying structural variants using linked-read sequencing data · Bioinform. 2018
Bioinformatics and computational biology
cancer genomics
0.112018
Identifying structural variants using linked-read sequencing data · Bioinform. 2018

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

network-structured mixture model · 0.9non-negative matrix factorization · 0.4network regularization · 0.4probabilistic model · 0.3barcoded read analysis · 0.3
YearPublicationVenuePosition
2020 NetMix: A Network-Structured Mixture Model for Reduced-Bias Estimation of Altered Subnetworks
Matthew A. Reyna, Uthsav Chitra, Rebecca Elyanow, Benjamin J. Raphael
RECOMB3
2019 netNMF-sc: A Network Regularization Algorithm for Dimensionality Reduction and Imputation of Single-Cell Expression Data
Rebecca Elyanow, Bianca Dumitrascu, Barbara E. Engelhardt, Benjamin J. Raphael
RECOMB1
2018 Identifying structural variants using linked-read sequencing data
abstract
MOTIVATION: Structural variation, including large deletions, duplications, inversions, translocations and other rearrangements, is common in human and cancer genomes. A number of methods have been developed to identify structural variants from Illumina short-read sequencing data. However, reliable identification of structural variants remains challenging because many variants have breakpoints in repetitive regions of the genome and thus are difficult to identify with short reads. The recently developed linked-read sequencing technology from 10X Genomics combines a novel barcoding strategy with Illumina sequencing. This technology labels all reads that originate from a small number (∼5 to 10) DNA molecules ∼50 Kbp in length with the same molecular barcode. These barcoded reads contain long-range sequence information that is advantageous for identification of structural variants. RESULTS: We present Novel Adjacency Identification with Barcoded Reads (NAIBR), an algorithm to identify structural variants in linked-read sequencing data. NAIBR predicts novel adjacencies in an individual genome resulting from structural variants using a probabilistic model that combines multiple signals in barcoded reads. We show that NAIBR outperforms several existing methods for structural variant identification-including two recent methods that also analyze linked-reads-on simulated sequencing data and 10X whole-genome sequencing data from the NA12878 human genome and the HCC1954 breast cancer cell line. Several of the novel somatic structural variants identified in HCC1954 overlap known cancer genes. AVAILABILITY AND IMPLEMENTATION: Software is available at compbio.cs.brown.edu/software. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Rebecca Elyanow, Hsin-Ta Wu, Benjamin J. Raphael
Bioinform.1