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.

Jeffrey R. O'Connell

dblp:53/1040 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
1since 2021 · last 2023
—ORCID · none

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

Applied, interdisciplinary, general and emerging computing · 2 · 1 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
1 paper
Bioinformatics and computational biology · 100%

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › statistical genetics
genomic prediction
0.712023
SLEMM: million-scale genomic predictions with window-based SNP weighting · Bioinform. 2023

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

stochastic lanczos algorithm · 0.7empirical BLUP · 0.7bayesr · 0.7
YearPublicationVenuePosition
2023 SLEMM: million-scale genomic predictions with window-based SNP weighting
abstract
MOTIVATION: The amount of genomic data is increasing exponentially. Using many genotyped and phenotyped individuals for genomic prediction is appealing yet challenging. RESULTS: We present SLEMM (short for Stochastic-Lanczos-Expedited Mixed Models), a new software tool, to address the computational challenge. SLEMM builds on an efficient implementation of the stochastic Lanczos algorithm for REML in a framework of mixed models. We further implement SNP weighting in SLEMM to improve its predictions. Extensive analyses on seven public datasets, covering 19 polygenic traits in three plant and three livestock species, showed that SLEMM with SNP weighting had overall the best predictive ability among a variety of genomic prediction methods including GCTA's empirical BLUP, BayesR, KAML, and LDAK's BOLT and BayesR models. We also compared the methods using nine dairy traits of ∼300k genotyped cows. All had overall similar prediction accuracies, except that KAML failed to process the data. Additional simulation analyses on up to 3 million individuals and 1 million SNPs showed that SLEMM was advantageous over counterparts as for computational performance. Overall, SLEMM can do million-scale genomic predictions with an accuracy comparable to BayesR. AVAILABILITY AND IMPLEMENTATION: The software is available at https://github.com/jiang18/slemm.
Christian Maltecca, Paul M. Vanraden, Jeffrey R. O'Connell, Jicai Jiang
Bioinform.4
2007 Fast Computation of Human Genetic Linkage
abstract
Genetic linkage analysis is a recombinant technology used for mapping disease genes on the genome, based on genotypic and phenotypic data collected from families that have affected members. The LOD score is a commonly used statistic in genetic linkage analysis. LOD scores are computed assuming specific values for genetic parameters. However, for complex disorders the specified parameter values are often unknown. One way to address this issue is to maximize the LOD score over all genetic parameters to get a maximum LOD score, or MOD score. Another way is to integrate the LOD score across the genetic parameters to form a posterior probability of linkage, or PPL. Both methods require calculation of large numbers of LOD scores under different sets of parameter values. These calculations may be very time-consuming and can form a significant bottleneck in disease gene mapping. The motivation for this work is to speed up the computation of large numbers of LOD scores in linkage analysis. Instead of the usual LOD calculation where the likelihood of a pedigree under each set of parameter values is computed based on traversing the pedigree, the likelihood of the pedigree is computed here as an algebraic expression that can be optimized and reused. This optimized likelihood expression can be evaluated an arbitrary number of times for LOD scores under different values of the genetic parameters, resulting in much faster speeds. Our initial results show that this approach can speed up the traditional genetic linkage computation by 10~1200 times.
Hongling Wang, Alberto M. Segre, Yungui Huang, Jeffrey R. O'Connell, Veronica J. Vieland
BIBE4