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

Jacob Schreiber

dblp:164/0932 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
2since 2021 · last 2025
0000-0003-4230-6625ORCID · corroborated

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

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

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › sequence analysis
sequence motif analysis
0.912025
Tomtom-lite: accelerating Tomtom enables large-scale and real-time motif similarity scoring · Bioinform. 2025
Machine learning › Probabilistic and Bayesian machine learning › structured models
graphical models
0.312017
pomegranate: Fast and Flexible Probabilistic Modeling in Python · J. Mach. Learn. Res. 2017
Bioinformatics and computational biology
sequence analysis
0.312025
Tomtom-lite: accelerating Tomtom enables large-scale and real-time motif similarity scoring · Bioinform. 2025
Bioinformatics and computational biology › sequence analysis
nanopore sequencing
0.212015
Analysis of nanopore data using hidden Markov models · Bioinform. 2015
Computational science and engineering
signal alignment
0.212015
Analysis of nanopore data using hidden Markov models · Bioinform. 2015
Bioinformatics and computational biology › epigenomics › DNA methylation
DNA methylation detection
0.112015
Analysis of nanopore data using hidden Markov models · Bioinform. 2015

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

numba acceleration · 0.9multithreading · 0.9approximation · 0.9expectation-maximization · 0.3hidden markov model · 0.2
YearPublicationVenuePosition
2025 Tomtom-lite: accelerating Tomtom enables large-scale and real-time motif similarity scoring
abstract
SUMMARY: Pairwise sequence similarity is a core operation in genomic analysis, yet most attention has been given to sequences made up of discrete characters. With the growing prevalence of machine learning, calculating similarities for sequences of continuous representations, e.g. frequency-based position-weight matrices (PWMs) and attribution-based contribution-weight matrices, is taking on newfound importance. Tomtom has previously been proposed as an algorithm for identifying pairs of PWMs whose similarity is statistically significant, but the implementation remains inefficient for both real-time and large-scale analysis. Accordingly, we have re-implemented Tomtom as a numba-accelerated Python function that is natively multi-threaded, avoids cache misses, more efficiently caches intermediate values, and uses approximations at compute bottlenecks. Here, we provide a detailed description of the original Tomtom method and present results demonstrating that our re-implementation can achieve over a 1000-fold speedup compared with the original tool on reasonable tasks. AVAILABILITY AND IMPLEMENTATION: Our implementation of Tomtom is freely available as a Python package at https://github.com/jmschrei/memesuite-lite, which can be downloaded via pip install memelite or at https://zenodo.org/records/17008952.
Jacob Schreiber
Bioinform.1
2023 Leveraging epigenomes and three-dimensional genome organization for interpreting regulatory variation
abstract
Understanding the impact of regulatory variants on complex phenotypes is a significant challenge because the genes and pathways that are targeted by such variants and the cell type context in which regulatory variants operate are typically unknown. Cell-type-specific long-range regulatory interactions that occur between a distal regulatory sequence and a gene offer a powerful framework for examining the impact of regulatory variants on complex phenotypes. However, high-resolution maps of such long-range interactions are available only for a handful of cell types. Furthermore, identifying specific gene subnetworks or pathways that are targeted by a set of variants is a significant challenge. We have developed L-HiC-Reg, a Random Forests regression method to predict high-resolution contact counts in new cell types, and a network-based framework to identify candidate cell-type-specific gene networks targeted by a set of variants from a genome-wide association study (GWAS). We applied our approach to predict interactions in 55 Roadmap Epigenomics Mapping Consortium cell types, which we used to interpret regulatory single nucleotide polymorphisms (SNPs) in the NHGRI-EBI GWAS catalogue. Using our approach, we performed an in-depth characterization of fifteen different phenotypes including schizophrenia, coronary artery disease (CAD) and Crohn's disease. We found differentially wired subnetworks consisting of known as well as novel gene targets of regulatory SNPs. Taken together, our compendium of interactions and the associated network-based analysis pipeline leverages long-range regulatory interactions to examine the context-specific impact of regulatory variation in complex phenotypes.
Brittany Baur, Junha Shin, Jacob Schreiber, Shilu Zhang, Yi Zhang 0055, Mohith Manjunath, Jun S. Song, William Stafford Noble, Sushmita Roy
PLoS Comput. Biol.3
2017 pomegranate: Fast and Flexible Probabilistic Modeling in Python
Jacob Schreiber
J. Mach. Learn. Res.1
2015 Analysis of nanopore data using hidden Markov models
abstract
MOTIVATION: Nanopore-based sequencing techniques can reconstruct properties of biosequences by analyzing the sequence-dependent ionic current steps produced as biomolecules pass through a pore. Typically this involves alignment of new data to a reference, where both reference construction and alignment have been performed by hand. RESULTS: We propose an automated method for aligning nanopore data to a reference through the use of hidden Markov models. Several features that arise from prior processing steps and from the class of enzyme used can be simply incorporated into the model. Previously, the M2MspA nanopore was shown to be sensitive enough to distinguish between cytosine, methylcytosine and hydroxymethylcytosine. We validated our automated methodology on a subset of that data by automatically calculating an error rate for the distinction between the three cytosine variants and show that the automated methodology produces a 2-3% error rate, lower than the 10% error rate from previous manual segmentation and alignment. AVAILABILITY AND IMPLEMENTATION: The data, output, scripts and tutorials replicating the analysis are available at https://github.com/UCSCNanopore/Data/tree/master/Automation.
Jacob Schreiber, Kevin Karplus
Bioinform.1