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

Geoffrey Fudenberg

dblp:155/4005 · DBLP profile ↗
← Back
6ranked-venue papers
1as first author
4since 2021 · last 2025
0000-0001-5905-6517ORCID · verified

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

Applied, interdisciplinary, general and emerging computing · 5 · 4 since 2021Graphics, computer vision, multimedia, augmented reality and games · 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 · 89% Medical and health informatics · 6% Computational science and engineering · 6%
Computer graphics and multimedia
1 paper
Image and video processing · 100%

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › genomics › genomic interval analysis
genomic interval operations
0.812024
Bioframe: operations on genomic intervals in Pandas dataframes · Bioinform. 2024
Computational science and engineering › inverse problem
bayesian image reconstruction
0.112009
Bayesian Image Recovery for Dendritic Structures Under Low Signal-to-Noise Conditions · IEEE Trans. Image Process. 2009
Medical and health informatics
neuroimaging
0.112009
Bayesian Image Recovery for Dendritic Structures Under Low Signal-to-Noise Conditions · IEEE Trans. Image Process. 2009
Image and video processing
image restoration
0.112009
Bayesian Image Recovery for Dendritic Structures Under Low Signal-to-Noise Conditions · IEEE Trans. Image Process. 2009

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

dataframe operations · 0.8poisson noise model · 0.2markov chain monte carlo · 0.2bayesian inference · 0.2
YearPublicationVenuePosition
2025 Interpreting the CTCF-mediated sequence grammar of genome folding with AkitaV2
abstract
Interphase mammalian genomes are folded in 3D with complex locus-specific patterns that impact gene regulation. CTCF (CCCTC-binding factor) is a key architectural protein that binds specific DNA sites, halts cohesin-mediated loop extrusion, and enables long-range chromatin interactions. There are hundreds of thousands of annotated CTCF-binding sites in mammalian genomes; disruptions of some result in distinct phenotypes, while others have no visible effect. Despite their importance, the determinants of which CTCF sites are necessary for genome folding and gene regulation remain unclear. Here, we update and utilize Akita, a convolutional neural network model, to extract the sequence preferences and grammar of CTCF contributing to genome folding. Our analyses of individual CTCF sites reveal four predictions: (i) only a small fraction of genomic sites are impactful; (ii) impact is highly dependent on sequences flanking the core CTCF binding motif; (iii) core and flanking nucleotides contribute largely additively to the overall impact of a site; (iv) sites created as combinations of different core and flanking sequences have impacts proportional to the product of their average impacts, i.e. they are broadly compatible. Our analysis of collections of CTCF sites make two predictions for multi-motif grammar: (i) insulation strength depends on the number of CTCF sites within a cluster, and (ii) pattern formation is governed by the orientation and spacing of these sites, rather than any inherent specialization of the CTCF motifs themselves. In sum, we present a framework for using neural network models to probe the sequences instructing genome folding and provide a number of predictions to guide future experimental inquiries.
Paulina N. Smaruj, Fahad Kamulegeya, David R. Kelley, Geoffrey Fudenberg
PLoS Comput. Biol.4
2024 Bioframe: operations on genomic intervals in Pandas dataframes
abstract
MOTIVATION: Genomic intervals are one of the most prevalent data structures in computational genome biology, and used to represent features ranging from genes, to DNA binding sites, to disease variants. Operations on genomic intervals provide a language for asking questions about relationships between features. While there are excellent interval arithmetic tools for the command line, they are not smoothly integrated into Python, one of the most popular general-purpose computational and visualization environments. RESULTS: Bioframe is a library to enable flexible and performant operations on genomic interval dataframes in Python. Bioframe extends the Python data science stack to use cases for computational genome biology by building directly on top of two of the most commonly-used Python libraries, NumPy and Pandas. The bioframe API enables flexible name and column orders, and decouples operations from data formats to avoid unnecessary conversions, a common scourge for bioinformaticians. Bioframe achieves these goals while maintaining high performance and a rich set of features. AVAILABILITY AND IMPLEMENTATION: Bioframe is open-source under MIT license, cross-platform, and can be installed from the Python Package Index. The source code is maintained by Open2C on GitHub at https://github.com/open2c/bioframe.
Nezar Abdennur, Geoffrey Fudenberg, Ilya M. Flyamer, Aleksandra A. Galitsyna, Anton Goloborodko, Maxim Imakaev, Sergey Venev
Bioinform.2
2024 Cooltools: Enabling high-resolution Hi-C analysis in Python
abstract
Chromosome conformation capture (3C) technologies reveal the incredible complexity of genome organization. Maps of increasing size, depth, and resolution are now used to probe genome architecture across cell states, types, and organisms. Larger datasets add challenges at each step of computational analysis, from storage and memory constraints to researchers' time; however, analysis tools that meet these increased resource demands have not kept pace. Furthermore, existing tools offer limited support for customizing analysis for specific use cases or new biology. Here we introduce cooltools (https://github.com/open2c/cooltools), a suite of computational tools that enables flexible, scalable, and reproducible analysis of high-resolution contact frequency data. Cooltools leverages the widely-adopted cooler format which handles storage and access for high-resolution datasets. Cooltools provides a paired command line interface (CLI) and Python application programming interface (API), which respectively facilitate workflows on high-performance computing clusters and in interactive analysis environments. In short, cooltools enables the effective use of the latest and largest genome folding datasets.
Nezar Abdennur, Sameer Abraham, Geoffrey Fudenberg, Ilya M. Flyamer, Aleksandra A. Galitsyna, Anton Goloborodko, Maxim Imakaev, Betul A. Oksuz, Sergey Venev
PLoS Comput. Biol.3
2024 Pairtools: From sequencing data to chromosome contacts
abstract
The field of 3D genome organization produces large amounts of sequencing data from Hi-C and a rapidly-expanding set of other chromosome conformation protocols (3C+). Massive and heterogeneous 3C+ data require high-performance and flexible processing of sequenced reads into contact pairs. To meet these challenges, we present pairtools-a flexible suite of tools for contact extraction from sequencing data. Pairtools provides modular command-line interface (CLI) tools that can be flexibly chained into data processing pipelines. The core operations provided by pairtools are parsing of.sam alignments into Hi-C pairs, sorting and removal of PCR duplicates. In addition, pairtools provides auxiliary tools for building feature-rich 3C+ pipelines, including contact pair manipulation, filtration, and quality control. Benchmarking pairtools against popular 3C+ data pipelines shows advantages of pairtools for high-performance and flexible 3C+ analysis. Finally, pairtools provides protocol-specific tools for restriction-based protocols, haplotype-resolved contacts, and single-cell Hi-C. The combination of CLI tools and tight integration with Python data analysis libraries makes pairtools a versatile foundation for a broad range of 3C+ pipelines.
Nezar Abdennur, Geoffrey Fudenberg, Ilya M. Flyamer, Aleksandra A. Galitsyna, Anton Goloborodko, Maxim Imakaev, Sergey Venev
PLoS Comput. Biol.2
2014 Chromatin Loops as Allosteric Modulators of Enhancer-Promoter Interactions
abstract
The classic model of eukaryotic gene expression requires direct spatial contact between a distal enhancer and a proximal promoter. Recent Chromosome Conformation Capture (3C) studies show that enhancers and promoters are embedded in a complex network of looping interactions. Here we use a polymer model of chromatin fiber to investigate whether, and to what extent, looping interactions between elements in the vicinity of an enhancer-promoter pair can influence their contact frequency. Our equilibrium polymer simulations show that a chromatin loop, formed by elements flanking either an enhancer or a promoter, suppresses enhancer-promoter interactions, working as an insulator. A loop formed by elements located in the region between an enhancer and a promoter, on the contrary, facilitates their interactions. We find that different mechanisms underlie insulation and facilitation; insulation occurs due to steric exclusion by the loop, and is a global effect, while facilitation occurs due to an effective shortening of the enhancer-promoter genomic distance, and is a local effect. Consistently, we find that these effects manifest quite differently for in silico 3C and microscopy. Our results show that looping interactions that do not directly involve an enhancer-promoter pair can nevertheless significantly modulate their interactions. This phenomenon is analogous to allosteric regulation in proteins, where a conformational change triggered by binding of a regulatory molecule to one site affects the state of another site.
Boryana Doyle, Geoffrey Fudenberg, Maxim Imakaev, Leonid A. Mirny
PLoS Comput. Biol.2
2009 Bayesian Image Recovery for Dendritic Structures Under Low Signal-to-Noise Conditions
abstract
Experimental research seeking to quantify neuronal structure constantly contends with restrictions on image resolution and variability. In particular, experimentalists often need to analyze images with very low signal-to-noise ratio (SNR). In many experiments, dye toxicity scales with the light intensity; this leads experimentalists to reduce image SNR in order to preserve the viability of the specimen. In this paper, we present a Bayesian approach for estimating the neuronal shape given low-SNR observations. This Bayesian framework has two major advantages. First, the method effectively incorporates known facts about 1) the image formation process, including blur and the Poisson nature of image noise at low intensities, and 2) dendritic shape, including the fact that dendrites are simply-connected geometric structures with smooth boundaries. Second, we may employ standard Markov chain Monte Carlo techniques for quantifying the posterior uncertainty in our estimate of the dendritic shape. We describe an efficient computational implementation of these methods and demonstrate the algorithm's performance on simulated noisy two-photon laser-scanning microscopy images.
Geoffrey Fudenberg, Liam Paninski
IEEE Trans. Image Process.1