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

David W. Craig

dblp:70/6075 · DBLP profile ↗
← Back
6ranked-venue papers
2as first author
0since 2021 · last 2008
0000-0003-2040-1955ORCID · corroborated

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

Applied, interdisciplinary, general and emerging computing · 4 · 1 first-authorSystems, architecture and hardware · 1Software engineering, systems software and programming languages · 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 · 100%
Computer architecture, parallel and distributed computing, and storage systems
3 papers
Embedded and real-time systems · 74% Performance modeling and evaluation · 24% High-performance computing · 3%

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › statistical genetics
genetic association study
0.112008
Multimarker analysis and imputation of multiple platform pooling-based genome-wide association studies · Bioinform. 2008
Bioinformatics and computational biology › genomics › genotyping
genotype imputation
0.112008
Multimarker analysis and imputation of multiple platform pooling-based genome-wide association studies · Bioinform. 2008
Bioinformatics and computational biology › statistical genetics
genotype calling
0.112007
SNiPer-HD: improved genotype calling accuracy by an expectation-maximization algorithm for high-density SNP arrays · Bioinform. 2007
Bioinformatics and computational biology › statistical genetics › genotype calling
SNP genotype calling
0.112007
SNiPer-HD: improved genotype calling accuracy by an expectation-maximization algorithm for high-density SNP arrays · Bioinform. 2007
Embedded and real-time systems
real-time scheduling
0.031990
The Rejection Rate for Tasks with Random Arrivals, Deadlines, and Preemptive Scheduling · IEEE Trans. Software Eng. 1990
Local Non-Preemptive Scheduling Policies for Hard Real-time Distributed Systems · RTSS 1987
Processing Bounds and Fast Allocation for Signal Processing Tasks with Cornerturning Transfers · RTSS 1985
Embedded and real-time systems › real-time scheduling
preemptive scheduling
0.011990
The Rejection Rate for Tasks with Random Arrivals, Deadlines, and Preemptive Scheduling · IEEE Trans. Software Eng. 1990
Performance modeling and evaluation
queueing models
0.011990
The Rejection Rate for Tasks with Random Arrivals, Deadlines, and Preemptive Scheduling · IEEE Trans. Software Eng. 1990
Embedded and real-time systems › real-time scheduling
non-preemptive scheduling
0.011987
Local Non-Preemptive Scheduling Policies for Hard Real-time Distributed Systems · RTSS 1987
Embedded and real-time systems
distributed real-time systems
0.011987
Local Non-Preemptive Scheduling Policies for Hard Real-time Distributed Systems · RTSS 1987

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

multimarker analysis · 0.1linkage disequilibrium modeling · 0.1quality control metric · 0.1expectation-maximization · 0.1queueing theory · 0.0approximation · 0.0
YearPublicationVenuePosition
2008 Multimarker analysis and imputation of multiple platform pooling-based genome-wide association studies
abstract
For many genome-wide association (GWA) studies individually genotyping one million or more SNPs provides a marginal increase in coverage at a substantial cost. Much of the information gained is redundant due to the correlation structure inherent in the human genome. Pooling-based GWA studies could benefit significantly by utilizing this redundancy to reduce noise, improve the accuracy of the observations and increase genomic coverage. We introduce a measure of correlation between individual genotyping and pooling, under the same framework that r(2) provides a measure of linkage disequilibrium (LD) between pairs of SNPs. We then report a new non-haplotype multimarker multi-loci method that leverages the correlation structure between SNPs in the human genome to increase the efficacy of pooling-based GWA studies. We first give a theoretical framework and derivation of our multimarker method. Next, we evaluate simulations using this multimarker approach in comparison to single marker analysis. Finally, we experimentally evaluate our method using different pools of HapMap individuals on the Illumina 450S Duo, Illumina 550K and Affymetrix 5.0 platforms for a combined total of 1 333 631 SNPs. Our results show that use of multimarker analysis reduces noise specific to pooling-based studies, allows for efficient integration of multiple microarray platforms and provides more accurate measures of significance than single marker analysis. Additionally, this approach can be extended to allow for imputing the association significance for SNPs not directly observed using neighboring SNPs in LD. This multimarker method can now be used to cost-effectively complete pooling-based GWA studies with multiple platforms across over one million SNPs and to impute neighboring SNPs weighted for the loss of information due to pooling.
Nils Homer, Waibhav Tembe, Szabolcs Szelinger, Margot Redman, Dietrich A. Stephan, John V. Pearson, Stanley F. Nelson, David W. Craig
Bioinform.8
2007 SNiPer-HD: improved genotype calling accuracy by an expectation-maximization algorithm for high-density SNP arrays
abstract
MOTIVATION: The technology to genotype single nucleotide polymorphisms (SNPs) at extremely high densities provides for hypothesis-free genome-wide scans for common polymorphisms associated with complex disease. However, we find that some errors introduced by commonly employed genotyping algorithms may lead to inflation of false associations between markers and phenotype. RESULTS: We have developed a novel SNP genotype calling program, SNiPer-High Density (SNiPer-HD), for highly accurate genotype calling across hundreds of thousands of SNPs. The program employs an expectation-maximization (EM) algorithm with parameters based on a training sample set. The algorithm choice allows for highly accurate genotyping for most SNPs. Also, we introduce a quality control metric for each assayed SNP, such that poor-behaving SNPs can be filtered using a metric correlating to genotype class separation in the calling algorithm. SNiPer-HD is superior to the standard dynamic modeling algorithm and is complementary and non-redundant to other algorithms, such as BRLMM. Implementing multiple algorithms together may provide highly accurate genotyping calls, without inflation of false positives due to systematically miss-called SNPs. A reliable and accurate set of SNP genotypes for increasingly dense panels will eliminate some false association signals and false negative signals, allowing for rapid identification of disease susceptibility loci for complex traits. AVAILABILITY: SNiPer-HD is available at TGen's website: http://www.tgen.org/neurogenomics/data.
Jianping Hua, David W. Craig, Marcel Brun, Jennifer Webster, Victoria Zismann, Waibhav Tembe, Keta Joshipura, Matthew J. Huentelman, Edward R. Dougherty, Dietrich A. Stephan
Bioinform.2
1990 The Rejection Rate for Tasks with Random Arrivals, Deadlines, and Preemptive Scheduling
abstract
A means of approximating light-traffic performance of RAD (random-arrivals-with-deadlines) systems for four basic preemptive scheduling policies is presented. The design goal is to keep congestion low enough to make the probability of rejection acceptably small. These designs must have low processor utilization. The study analyzes rejection probabilities at utilizations up to 20% and rejection probabilities up to about 10% for various well-known preemptive scheduling disciplines (shortest job first, earliest due date, and least laxity first), as well as first-come, first-served. Good approximations for the rejection probability and for a number of other properties, such as the distribution of time-to-go at rejection, are found.>
David W. Craig, C. Murray Woodside
IEEE Trans. Software Eng.1
1987 Local Non-Preemptive Scheduling Policies for Hard Real-time Distributed Systems
C. Murray Woodside, David W. Craig
RTSS2
1985 Processing Bounds and Fast Allocation for Signal Processing Tasks with Cornerturning Transfers
David W. Craig, C. Murray Woodside
RTSS1
1984 Function Allocation in a Thightly Coupled Signal Multiprocessor
C. Murray Woodside, David W. Craig
ICDCS2