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

Matthew C. Keller

dblp:197/8493 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
2since 2021 · last 2026
0000-0002-6075-9882ORCID · corroborated

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

Applied, interdisciplinary, general and emerging computing · 3 · 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
3 papers
Bioinformatics and computational biology · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Parallel and multicore computing · 100%

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology
genomics
1.522026
A novel method for across-chromosome phasing without relative data · Bioinform. 2026
Novel approach for parallelizing pairwise comparison problems as applied to detecting segments identical by decent in whole-genome data · Bioinform. 2021
Bioinformatics and computational biology › statistical genetics › haplotype analysis
haplotype phasing
1.012026
A novel method for across-chromosome phasing without relative data · Bioinform. 2026
Bioinformatics and computational biology › statistical genetics
genetic data simulation
0.312017
GeneEvolve: a fast and memory efficient forward-time simulator of realistic whole-genome sequence and SNP data · Bioinform. 2017
Bioinformatics and computational biology
population genetics
0.312017
GeneEvolve: a fast and memory efficient forward-time simulator of realistic whole-genome sequence and SNP data · Bioinform. 2017
Parallel and multicore computing
parallel algorithms
0.112021
Novel approach for parallelizing pairwise comparison problems as applied to detecting segments identical by decent in whole-genome data · Bioinform. 2021

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

window-based SNP-similarity metric · 1.0parallelization · 1.0forward-time simulation · 0.3
YearPublicationVenuePosition
2026 A novel method for across-chromosome phasing without relative data
abstract
MOTIVATION: Across-chromosome phasing identifies which haplotypes of different chromosomes come from the same parent. This differs from within-chromosome phasing, which uses linkage disequilibrium patterns to determine which alleles were co-inherited within each chromosome but does not match haplotypes across different chromosomes. While across-chromosome phasing can be conducted using genotypes from parents or close relatives, current methods perform poorly for samples of unrelated individuals. Here, we introduce a novel approach for across-chromosome phasing that employs a window-based SNP-similarity metric, eliminating the need for data from close relatives or detection of identical-by-descent haplotypes. RESULTS: Using UK Biobank offspring with both parents genotyped as a gold standard, we evaluated the performance of our method by phasing the offspring without using parental data. In genomic data with no within-chromosome phase errors, our algorithm achieved a mean across-chromosome phasing accuracy of 95%, with 53% of individuals phased perfectly. When data was pre-phased computationally using a standard within-chromosome phasing algorithm, mean accuracy for across-chromosome phasing dropped to 83.1%. Thus, our method is limited primarily by the accuracy of within-chromosome phasing accuracy and can approach near-perfect across-chromosome phasing accuracy as within-chromosome phasing accuracy improves. AVAILABILITY AND IMPLEMENTATION: The implementation was executed within a multi-node computational environment of University of Colorado Boulder Research Computing (Blanca Cluster: https://www.colorado.edu/rc/resources/blanca), employing parallelization techniques in the C programming language. The source code has been made publicly accessible online at https://github.com/emmanuelsapin/AcrossChromosomesPhasing, thereby facilitating reproducibility of the results for researchers with authorized access to the UK Biobank dataset.
Emmanuel Sapin, Kristen M. Kelly, Matthew C. Keller
Bioinform.3
2021 Novel approach for parallelizing pairwise comparison problems as applied to detecting segments identical by decent in whole-genome data
abstract
MOTIVATION: Pairwise comparison problems arise in many areas of science. In genomics, datasets are already large and getting larger, and so operations that require pairwise comparisons-either on pairs of SNPs or pairs of individuals-are extremely computationally challenging. We propose a generic algorithm for addressing pairwise comparison problems that breaks a large problem (of order n2 comparisons) into multiple smaller ones (each of order n comparisons), allowing for massive parallelization. RESULTS: We demonstrated that this approach is very efficient for calling identical by descent (IBD) segments between all pairs of individuals in the UK Biobank dataset, with a 250-fold savings in time and 750-fold savings in memory over the standard approach to detecting such segments across the full dataset. This efficiency should extend to other methods of IBD calling and, more generally, to other pairwise comparison tasks in genomics or other areas of science. AVAILABILITY AND IMPLEMENTATION: A GitHub page is available at https://github.com/emmanuelsapin with the code to generate data needed for the implementation.
Emmanuel Sapin, Matthew C. Keller
Bioinform.2
2017 GeneEvolve: a fast and memory efficient forward-time simulator of realistic whole-genome sequence and SNP data
abstract
MOTIVATION: Computer simulations are excellent tools for understanding the evolutionary and genetic consequences of complex processes that cannot be analytically predicted and for creating realistic genetic data. There are many software packages that simulate genetic data, but they are typically not fast or memory efficient enough to simulate realistic, individual-level genome-wide SNP/sequence data. RESULTS: GeneEvolve is a user-friendly and efficient population genetics simulator that handles complex evolutionary and life history scenarios and generates individual-level phenotypes and realistic whole-genome sequence or SNP data. GeneEvolve runs forward-in-time, which allows it to provide a wide range of scenarios for mating systems, selection, population size and structure, migration, recombination and environmental effects. The software is designed to use as input data from real or previously simulated phased haplotypes, allowing it to mimic very closely the properties of real genomic data. AVAILABILITY AND IMPLEMENTATION: GeneEvolve is freely available at https://github.com/rtahmasbi/GeneEvolve CONTACT: [email protected] information: Supplementary data are available at Bioinformatics online.
Rasool Tahmasbi, Matthew C. Keller
Bioinform.2