Demo Data from EDBT 2026 / reviewers in the wild / expert
Simon Cawley
dblp:76/1610
· DBLP profile ↗
3ranked-venue papers
0as first author
0since 2021 · last 2007
0000-0001-5694-7947ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 3
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% |
Topics — the 9 heaviest of 9, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology
genomics |
0.1 | 2 | 2007 | Dynamic model based algorithms for screening and genotyping over 100K SNPs on oligonucleotide microarrays · Bioinform. 2005 LdCompare: rapid computation of single- and multiple-marker r2 and genetic coverage · Bioinform. 2007 |
Bioinformatics and computational biology › population genetics
linkage disequilibrium |
0.1 | 1 | 2007 | LdCompare: rapid computation of single- and multiple-marker r2 and genetic coverage · Bioinform. 2007 |
Bioinformatics and computational biology
population genetics |
0.1 | 1 | 2007 | LdCompare: rapid computation of single- and multiple-marker r2 and genetic coverage · Bioinform. 2007 |
Bioinformatics and computational biology › genomics
genotyping |
0.1 | 1 | 2005 | Dynamic model based algorithms for screening and genotyping over 100K SNPs on oligonucleotide microarrays · Bioinform. 2005 |
Bioinformatics and computational biology › phylogenetics › phylogenetic inference › statistical alignment
pair hidden markov model |
0.0 | 1 | 2001 | Applications of generalized pair hidden Markov models to alignment and gene finding problems · RECOMB 2001 |
Bioinformatics and computational biology
sequence alignment |
0.0 | 1 | 2001 | Applications of generalized pair hidden Markov models to alignment and gene finding problems · RECOMB 2001 |
Bioinformatics and computational biology › genomics
genome-wide association study |
0.0 | 1 | 2007 | LdCompare: rapid computation of single- and multiple-marker r2 and genetic coverage · Bioinform. 2007 |
Bioinformatics and computational biology › gene expression analysis
microarray data analysis |
0.0 | 1 | 2005 | Dynamic model based algorithms for screening and genotyping over 100K SNPs on oligonucleotide microarrays · Bioinform. 2005 |
Bioinformatics and computational biology › genome annotation
gene prediction |
0.0 | 1 | 2001 | Applications of generalized pair hidden Markov models to alignment and gene finding problems · RECOMB 2001 |
Methods — techniques the papers use, named apart from their topics
genetic coverage estimation · 0.1efficient computation of r2 · 0.1maximum likelihood estimation · 0.1dynamic model-based algorithm · 0.1viterbi algorithm · 0.0generalized pair hidden markov model · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2007 | LdCompare: rapid computation of single- and multiple-marker r2 and genetic coverageabstractUNLABELLED: The scale of genetic-variation datasets has increased enormously and the linkage equilibrium (LD) structure of these polymorphisms, particularly in whole-genome association studies, is of great interest. The significant computational complexity of calculating single- and multiple-marker correlations at a genome-wide scale remains challenging. We have developed a program that efficiently characterizes whole-genome LD structure on large number of SNPs in terms of single- and multiple-marker correlations. AVAILABILITY: LdCompare is licensed under the GNU General Public License (GPL). Source code, documentation, testing datasets and precompiled executables are available for download at: http://www.affymetrix.com/support/developer/tools/devnettools.affx K. Hao, Xiaojun Di, Simon Cawley |
Bioinform. | 3 |
| 2005 | Dynamic model based algorithms for screening and genotyping over 100K SNPs on oligonucleotide microarraysabstractMOTIVATION: A high density of single nucleotide polymorphism (SNP) coverage on the genome is desirable and often an essential requirement for population genetics studies. Region-specific or chromosome-specific linkage studies also benefit from the availability of as many high quality SNPs as possible. The availability of millions of SNPs from both Perlegen and the public domain and the development of an efficient microarray-based assay for genotyping SNPs has brought up some interesting analytical challenges. Effective methods for the selection of optimal subsets of SNPs spanning the genome and methods for accurately calling genotypes from probe hybridization patterns have enabled the development of a new microarray-based system for robustly genotyping over 100,000 SNPs per sample. RESULTS: We introduce a new dynamic model-based algorithm (DM) for screening over 3 million SNPs and genotyping over 100,000 SNPs. The model is based on four possible underlying states: Null, A, AB and B for each probe quartet. We calculate a probe-level log likelihood for each model and then select between the four competing models with an SNP-level statistical aggregation across multiple probe quartets to provide a high-quality genotype call along with a quality measure of the call. We assess performance with HapMap reference genotypes, informative Mendelian inheritance relationship in families, and consistency between DM and another genotype classification method. At a call rate of 95.91% the concordance with reference genotypes from the HapMap Project is 99.81% based on over 1.5 million genotypes, the Mendelian error rate is 0.018% based on 10 trios, and the consistency between DM and MPAM is 99.90% at a comparable rate of 97.18%. We also develop methods for SNP selection and optimal probe selection. AVAILABILITY: The DM algorithm is available in Affymetrix's Genotyping Tools software package and in Affymetrix's GDAS software package. See http://www.affymetrix.com for further information. 10 K and 100 K mapping array data are available on the Affymetrix website. Xiaojun Di, Hajime Matsuzaki, Teresa A. Webster, Earl Hubbell, Shoulian Dong, Dan Bartell, Jing Huang 0024, Richard Chiles, Geoffrey Yang, Mei-mei Shen, David Kulp, Giulia C. Kennedy, Rui Mei, Keith W. Jones, Simon Cawley |
Bioinform. | 16 |
| 2001 | Applications of generalized pair hidden Markov models to alignment and gene finding problemsabstractHidden Markov models (HMMs) have been successfully applied to a variety of problems in molecular biology, ranging from alignment problems to gene finding and annotation. Alignment problems can be solved with pair HMMs, while gene finding programs rely on generalized HMMs in order to model exon lengths. In this paper we introduce the generalized pair HMM (GPHMM), which is an extension of both pair and generalized HMMs. We show how GPHMMs, in conjunction with approximate alignments, can be used for cross-species gene finding, and describe applications to DNA-cDNA and DNA-protein alignment. GPHMMs provide a unifying and probabilistically sound theory for modeling these problems. Lior Pachter, Marina Alexandersson, Simon Cawley |
RECOMB | 3 |