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

Kristin C. Gunsalus

dblp:81/3808 · DBLP profile ↗
← Back
11ranked-venue papers
0as first author
2since 2021 · last 2026
0000-0001-9769-4624ORCID · corroborated

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

Applied, interdisciplinary, general and emerging computing · 7 · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 4Artificial intelligence and machine learning · 2

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.

Computer graphics and multimedia
1 paper
Multimedia analysis and retrieval · 77% Image and video processing · 23%
Artificial intelligence
1 paper
Image recognition and object detection · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%

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

TopicWeightPapersLastEvidence papers
Multimedia analysis and retrieval › image analysis
geometric image analysis
0.212014
Mirror Symmetry Histograms for Capturing Geometric Properties in Images · CVPR 2014
Image and video processing
feature representation
0.112014
Mirror Symmetry Histograms for Capturing Geometric Properties in Images · CVPR 2014

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

support vector machine · 0.2segmentation · 0.2hierarchical grouping · 0.2supervised classification · 0.2histogram-based representation · 0.2
YearPublicationVenuePosition
2026 MIMI: Molecular Isotope Mass Identifier for stable isotope-labeled Fourier transform ultra-high mass resolution data analysis
abstract
BACKGROUND: Ultra High Resolution (UHR) mass spectrometry systems with Fourier Transform Ion Cyclotron Resonance (FT-ICR) are often used to analyze the composition of complex mixtures of naturally-occurring or isotopically-enriched small molecules, such as metabolite samples for environmental, biological, or paleontological studies. The extremely high resolution of these systems enables simultaneous measurement of the exact masses of tens of thousands of molecular features and accurate determination of chemical formulas based on isotopic fine-structure ratios. To accelerate and streamline analysis of these datasets, automated solutions to rapidly characterize the molecular composition of unknown samples by comparison with known reference databases are needed. RESULTS: Here we present Molecular Isotope Mass Identifier (MIMI), a commandline tool to identify molecules present in complex samples using data from UHR-FT-ICR mass spectrometry. Given a database of known molecules and expected ratios of atomic isotopes in the sample, MIMI first computes theoretical exact masses and expected abundance for all possible isotopic variants in the database. Chemical formulas from publicly available databases and/or custom lists of molecules of interest can be used as reference data for comparison. By default MIMI is configured to use natural isotopic abundances, but its advantage is it can easily accommodate different user-defined isotopic labeling ratios for any element(s). Candidate molecules are first identified in peak lists from UHR-FT-ICR mass spectrometry runs by comparing masses detected in the experimental data with precomputed theoretical masses for all entries in the reference database. Chemical formulas are then verified by counting isotopic fine-structure matches with the theoretical values for all possible molecular isotopic variants and can be further validated by comparing observed vs. expected relative peak heights. We illustrate MIMI’s utility using metabolite data from a cultured diatom sample isolated from seawater in the Arabian Gulf and spiked with 13C-labeled internal standards, as well as a sample containing naturally-abundant metabolite standards. CONCLUSIONS: We introduce a simple commandline tool, MIMI, that rapidly identifies chemicals present in samples of complex composition using UHR-FT-ICR mass spectrometry data. MIMI can compare measured data against both standard and customized molecular databases and can accommodate natural or user-specified isotope ratios. This software provides a convenient tool for simultaneous determination of natural and isotope-labeled compounds within the same sample, particularly for rapid characterization of complex mixtures of metabolites.
Nabil Rahiman, Michael A. Ochsenkühn, Shady A. Amin, Kristin C. Gunsalus
BMC Bioinform.4
2021 Pheniqs 2.0: accurate, high-performance Bayesian decoding and confidence estimation for combinatorial barcode indexing
abstract
BACKGROUND: Systems biology increasingly relies on deep sequencing with combinatorial index tags to associate biological sequences with their sample, cell, or molecule of origin. Accurate data interpretation depends on the ability to classify sequences based on correct decoding of these combinatorial barcodes. The probability of correct decoding is influenced by both sequence quality and the number and arrangement of barcodes. The rising complexity of experimental designs calls for a probability model that accounts for both sequencing errors and random noise, generalizes to multiple combinatorial tags, and can handle any barcoding scheme. The needs for reproducibility and community benchmark standards demand a peer-reviewed tool that preserves decoding quality scores and provides tunable control over classification confidence that balances precision and recall. Moreover, continuous improvements in sequencing throughput require a fast, parallelized and scalable implementation. RESULTS AND DISCUSSION: We developed a flexible, robustly engineered software that performs probabilistic decoding and supports arbitrarily complex barcoding designs. Pheniqs computes the full posterior decoding error probability of observed barcodes by consulting basecalling quality scores and prior distributions, and reports sequences and confidence scores in Sequence Alignment/Map (SAM) fields. The product of posteriors for multiple independent barcodes provides an overall confidence score for each read. Pheniqs achieves greater accuracy than minimum edit distance or simple maximum likelihood estimation, and it scales linearly with core count to enable the classification of > 11 billion reads in 1 h 15 m using < 50 megabytes of memory. Pheniqs has been in production use for seven years in our genomics core facility. CONCLUSION: We introduce a computationally efficient software that implements both probabilistic and minimum distance decoders and show that decoding barcodes using posterior probabilities is more accurate than available methods. Pheniqs allows fine-tuning of decoding sensitivity using intuitive confidence thresholds and is extensible with alternative decoders and new error models. Any arbitrary arrangement of barcodes is easily configured, enabling computation of combinatorial confidence scores for any barcoding strategy. An optimized multithreaded implementation assures that Pheniqs is faster and scales better with complex barcode sets than existing tools. Support for POSIX streams and multiple sequencing formats enables easy integration with automated analysis pipelines.
Lior Galanti, Dennis E. Shasha, Kristin C. Gunsalus
BMC Bioinform.3
2020 NASQAR: a web-based platform for high-throughput sequencing data analysis and visualization
abstract
BACKGROUND: As high-throughput sequencing applications continue to evolve, the rapid growth in quantity and variety of sequence-based data calls for the development of new software libraries and tools for data analysis and visualization. Often, effective use of these tools requires computational skills beyond those of many researchers. To ease this computational barrier, we have created a dynamic web-based platform, NASQAR (Nucleic Acid SeQuence Analysis Resource). RESULTS: NASQAR offers a collection of custom and publicly available open-source web applications that make extensive use of a variety of R packages to provide interactive data analysis and visualization. The platform is publicly accessible at http://nasqar.abudhabi.nyu.edu/ . Open-source code is on GitHub at https://github.com/nasqar/NASQAR , and the system is also available as a Docker image at https://hub.docker.com/r/aymanm/nasqarall . NASQAR is a collaboration between the core bioinformatics teams of the NYU Abu Dhabi and NYU New York Centers for Genomics and Systems Biology. CONCLUSIONS: NASQAR empowers non-programming experts with a versatile and intuitive toolbox to easily and efficiently explore, analyze, and visualize their Transcriptomics data interactively. Popular tools for a variety of applications are currently available, including Transcriptome Data Preprocessing, RNA-seq Analysis (including Single-cell RNA-seq), Metagenomics, and Gene Enrichment.
Ayman Yousif, Nizar Drou, Jillian Rowe, Mohammed Khalfan, Kristin C. Gunsalus
BMC Bioinform.5
2016 Erratum to: MINE: Module Identification in Networks
abstract
Erratum It was brought to our attention that there was a discrepancy between the description and implementation of the MINE algorithm in our article [1]. We regret any inconvenience that may have resulted from this inaccuracy. The primary difference is that as implemented, only the immediate neighborhood of each node is searched to identify initial clusters, and the merging process then facilitates cluster growth and removal of redundant clusters. This implementation results in accelerated cluster prediction relative to a more exhaustive search, which would perform comparably to a depthfirst search across a larger portion of the network for each node. The published results and performance of MINE are unaffected; the description of the method, algorithm pseudocode, Fig. 1, and Additional file 1: Figure S1 have been updated to accurately reflect the implemented version of MINE.
Kahn Rhrissorrakrai, Kristin C. Gunsalus
BMC Bioinform.2
2014 Mirror Symmetry Histograms for Capturing Geometric Properties in Images
abstract
We propose a data structure that captures global geometric properties in images: Histogram of Mirror Symmetry Coefficients. We compute such a coefficient for every pair of pixels, and group them in a 6-dimensional histogram. By marginalizing the HMSC in various ways, we develop algorithms for a range of applications: detection of nearly-circular cells, location of the main axis of reflection symmetry, detection of cell-division in movies of developing embryos, detection of worm-tips and indirect cell-counting via supervised classification. Our approach generalizes a series of histogram-related methods, and the proposed algorithms perform with state-of-the-art accuracy.
Marcelo Cicconet, Davi Geiger, Kristin C. Gunsalus, Michael Werman
CVPR3
2014 Shape statistics for cell division detection in time-lapse videos of early mouse embryo
abstract
We describe a statistical approach to the problem of estimating the times of cell-division cycles in time-lapse movies of early mouse embryos. Our method is based on the likelihoods for cells of certain radii ranges to be in each frame — without actually locating or counting the cells. Computing the likelihoods consists of a voting scheme where votes come form quadruples of points in a way similar to the first step of the Randomized Hough Transform for ellipse detection. To locate divisions, we search for points of abrupt change in the matrix of likelihoods (built for all frames), and pick the two optimal division points using a dynamic programming algorithm. Our results for the first and second cell division cycles differ less than two frames from the medians of the annotated times in a database of 100 annotated videos, and outperform two other recent methods in the same set.
Marcelo Cicconet, Kristin C. Gunsalus, Davi Geiger, Michael Werman
ICIP2
2014 Ellipses from triangles
abstract
We present an ellipse finding and fitting algorithm that uses points and tangents, rather than just points, as the basic unit of information. These units are analyzed in a hierarchy: points with tangents are paired into triangles in the first layer and pairs of triangles in the second layer vote for ellipse centers. The remaining parameters are estimated via robust linear algebra: eigen-decomposition and iteratively reweighed least squares. Our method outperforms the state-of-the-art approach in synthetic images and microscopic images of cells.
Marcelo Cicconet, Kristin C. Gunsalus, Davi Geiger, Michael Werman
ICIP2
2013 DevStaR: High-Throughput Quantification of C. elegans Developmental Stages
abstract
We present DevStaR, an automated computer vision and machine learning system that provides rapid, accurate, and quantitative measurements of C. elegans embryonic viability in high-throughput (HTP) applications. A leading genetic model organism for the study of animal development and behavior, C. elegans is particularly amenable to HTP functional genomic analysis due to its small size and ease of cultivation, but the lack of efficient and quantitative methods to score phenotypes has become a major bottleneck. DevStaR addresses this challenge using a novel hierarchical object recognition machine that rapidly segments, classifies, and counts animals at each developmental stage in images of mixed-stage populations of C. elegans. Here, we describe the algorithmic design of the DevStaR system and demonstrate its performance in scoring image data acquired in HTP screens.
Amelia G. White, Brandon Lees, Huey-Ling Kao, Patricia G. Cipriani, Eliana Munarriz, Annalise B. Paaby, Katherine Erickson, Sherly Guzman, Kirk Rattanakorn, Eduardo D. Sontag, Davi Geiger, Kristin C. Gunsalus, Fabio Piano
IEEE Trans. Medical Imaging12
2011 MINE: Module Identification in NEtworks
abstract
BACKGROUND: Graphical models of network associations are useful for both visualizing and integrating multiple types of association data. Identifying modules, or groups of functionally related gene products, is an important challenge in analyzing biological networks. However, existing tools to identify modules are insufficient when applied to dense networks of experimentally derived interaction data. To address this problem, we have developed an agglomerative clustering method that is able to identify highly modular sets of gene products within highly interconnected molecular interaction networks. RESULTS: MINE outperforms MCODE, CFinder, NEMO, SPICi, and MCL in identifying non-exclusive, high modularity clusters when applied to the C. elegans protein-protein interaction network. The algorithm generally achieves superior geometric accuracy and modularity for annotated functional categories. In comparison with the most closely related algorithm, MCODE, the top clusters identified by MINE are consistently of higher density and MINE is less likely to designate overlapping modules as a single unit. MINE offers a high level of granularity with a small number of adjustable parameters, enabling users to fine-tune cluster results for input networks with differing topological properties. CONCLUSIONS: MINE was created in response to the challenge of discovering high quality modules of gene products within highly interconnected biological networks. The algorithm allows a high degree of flexibility and user-customisation of results with few adjustable parameters. MINE outperforms several popular clustering algorithms in identifying modules with high modularity and obtains good overall recall and precision of functional annotations in protein-protein interaction networks from both S. cerevisiae and C. elegans.
Kahn Rhrissorrakrai, Kristin C. Gunsalus
BMC Bioinform.2
2010 Rapid and accurate developmental stage recognition of C. elegans from high-throughput image data
abstract
We present a hierarchical principle for object recognition and its application to automatically classify developmental stages of C. elegans animals from a population of mixed stages. The object recognition machine consists of four hierarchical layers, each composed of units upon which evaluation functions output a label score, followed by a grouping mechanism that resolves ambiguities in the score by imposing local consistency constraints. Each layer then outputs groups of units, from which the units of the next layer are derived. Using this hierarchical principle, the machine builds up successively more sophisticated representations of the objects to be classified. The algorithm segments large and small objects, decomposes objects into parts, extracts features from these parts, and classifies them by SVM. We are using this system to analyze phenotypic data from C. elegans high-throughput genetic screens, and our system overcomes a previous bottleneck in image analysis by achieving near real-time scoring of image data. The system is in current use in a functioning C. elegans laboratory and has processed over two hundred thousand images for lab users.
Amelia G. White, Patricia G. Cipriani, Huey-Ling Kao, Brandon Lees, Davi Geiger, Eduardo D. Sontag, Kristin C. Gunsalus, Fabio Piano
CVPR7
2005 microRNA Target Predictions across Seven Drosophila Species and Comparison to Mammalian Targets
abstract
microRNAs are small noncoding genes that regulate the protein production of genes by binding to partially complementary sites in the mRNAs of targeted genes. Here, using our algorithm PicTar, we exploit cross-species comparisons to predict, on average, 54 targeted genes per microRNA above noise in Drosophila melanogaster. Analysis of the functional annotation of target genes furthermore suggests specific biological functions for many microRNAs. We also predict combinatorial targets for clustered microRNAs and find that some clustered microRNAs are likely to coordinately regulate target genes. Furthermore, we compare microRNA regulation between insects and vertebrates. We find that the widespread extent of gene regulation by microRNAs is comparable between flies and mammals but that certain microRNAs may function in clade-specific modes of gene regulation. One of these microRNAs (miR-210) is predicted to contribute to the regulation of fly oogenesis. We also list specific regulatory relationships that appear to be conserved between flies and mammals. Our findings provide the most extensive microRNA target predictions in Drosophila to date, suggest specific functional roles for most microRNAs, indicate the existence of coordinate gene regulation executed by clustered microRNAs, and shed light on the evolution of microRNA function across large evolutionary distances. All predictions are freely accessible at our searchable Web site http://pictar.bio.nyu.edu.
Dominic Grün, Yi-Lu Wang, David Langenberger, Kristin C. Gunsalus, Nikolaus Rajewsky
PLoS Comput. Biol.4