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

Paul I. W. de Bakker

dblp:61/348 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
0since 2021 · last 2014
0000-0001-7735-7858ORCID · corroborated

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

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

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › genomics
genome-wide association study
0.322014
Fast pairwise IBD association testing in genome-wide association studies · Bioinform. 2014
SNAP: a web-based tool for identification and annotation of proxy SNPs using HapMap · Bioinform. 2008
Bioinformatics and computational biology
statistical genetics
0.212014
Fast pairwise IBD association testing in genome-wide association studies · Bioinform. 2014
Bioinformatics and computational biology › population genetics
linkage disequilibrium
0.112008
SNAP: a web-based tool for identification and annotation of proxy SNPs using HapMap · Bioinform. 2008
Bioinformatics and computational biology
phylogenetics
0.012003
Pandit: a database of protein and associated nucleotide domains with inferred trees · Bioinform. 2003
Bioinformatics and computational biology › phylogenetics
phylogenetic inference
0.012003
Pandit: a database of protein and associated nucleotide domains with inferred trees · Bioinform. 2003
Bioinformatics and computational biology › biological database
sequence database
0.012003
Pandit: a database of protein and associated nucleotide domains with inferred trees · Bioinform. 2003
Bioinformatics and computational biology › protein structure analysis
protein structure alignment
0.012001
HOMSTRAD: adding sequence information to structure-based alignments of homologous protein families · Bioinform. 2001
Bioinformatics and computational biology › structural bioinformatics › sequence-structure relationship
sequence-structure integration
0.012001
HOMSTRAD: adding sequence information to structure-based alignments of homologous protein families · Bioinform. 2001
Bioinformatics and computational biology
structural bioinformatics
0.012001
HOMSTRAD: adding sequence information to structure-based alignments of homologous protein families · Bioinform. 2001
Bioinformatics and computational biology
genetic variation
0.012008
SNAP: a web-based tool for identification and annotation of proxy SNPs using HapMap · Bioinform. 2008
Bioinformatics and computational biology › genomics › variant annotation
SNP annotation
0.012008
SNAP: a web-based tool for identification and annotation of proxy SNPs using HapMap · Bioinform. 2008

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

permutation testing · 0.2importance sampling · 0.2hapmap-based query · 0.1neighbor-joining · 0.0maximum likelihood · 0.0
YearPublicationVenuePosition
2014 Fast pairwise IBD association testing in genome-wide association studies
abstract
MOTIVATION: Recently, investigators have proposed state-of-the-art Identity-by-descent (IBD) mapping methods to detect IBD segments between purportedly unrelated individuals. The IBD information can then be used for association testing in genetic association studies. One approach for this IBD association testing strategy is to test for excessive IBD between pairs of cases ('pairwise method'). However, this approach is inefficient because it requires a large number of permutations. Moreover, a limited number of permutations define a lower bound for P-values, which makes fine-mapping of associated regions difficult because, in practice, a much larger genomic region is implicated than the region that is actually associated. RESULTS: In this article, we introduce a new pairwise method 'Fast-Pairwise'. Fast-Pairwise uses importance sampling to improve efficiency and enable approximation of extremely small P-values. Fast-Pairwise method takes only days to complete a genome-wide scan. In the application to the WTCCC type 1 diabetes data, Fast-Pairwise successfully fine-maps a known human leukocyte antigen gene that is known to cause the disease. AVAILABILITY: Fast-Pairwise is publicly available at: http://genetics.cs.ucla.edu/graphibd.
Buhm Han, Eun Yong Kang, Soumya Raychaudhuri, Paul I. W. de Bakker, Eleazar Eskin
Bioinform.4
2008 SNAP: a web-based tool for identification and annotation of proxy SNPs using HapMap
abstract
SUMMARY: The interpretation of genome-wide association results is confounded by linkage disequilibrium between nearby alleles. We have developed a flexible bioinformatics query tool for single-nucleotide polymorphisms (SNPs) to identify and to annotate nearby SNPs in linkage disequilibrium (proxies) based on HapMap. By offering functionality to generate graphical plots for these data, the SNAP server will facilitate interpretation and comparison of genome-wide association study results, and the design of fine-mapping experiments (by delineating genomic regions harboring associated variants and their proxies). AVAILABILITY: SNAP server is available at http://www.broad.mit.edu/mpg/snap/.
Andrew D. Johnson, Robert E. Handsaker, Sara L. Pulit, Marcia M. Nizzari, Christopher J. O'Donnell, Paul I. W. de Bakker
Bioinform.6
2003 Pandit: a database of protein and associated nucleotide domains with inferred trees
abstract
MOTIVATION: A large, high-quality database of homologous sequence alignments with good estimates of their corresponding phylogenetic trees will be a valuable resource to those studying phylogenetics. It will allow researchers to compare current and new models of sequence evolution across a large variety of sequences. The large quantity of data may provide inspiration for new models and methodology to study sequence evolution and may allow general statements about the relative effect of different molecular processes on evolution. RESULTS: The Pandit 7.6 database contains 4341 families of sequences derived from the seed alignments of the Pfam database of amino acid alignments of families of homologous protein domains (Bateman et al., 2002). Each family in Pandit includes an alignment of amino acid sequences that matches the corresponding Pfam family seed alignment, an alignment of DNA sequences that contain the coding sequence of the Pfam alignment when they can be recovered (overall, 82.9% of sequences taken from Pfam) and the alignment of amino acid sequences restricted to only those sequences for which a DNA sequence could be recovered. Each of the alignments has an estimate of the phylogenetic tree associated with it. The tree topologies were obtained using the neighbor joining method based on maximum likelihood estimates of the evolutionary distances, with branch lengths then calculated using a standard maximum likelihood approach.
Simon Whelan, Paul I. W. de Bakker, Nick Goldman
Bioinform.2
2001 HOMSTRAD: adding sequence information to structure-based alignments of homologous protein families
abstract
summary: We describe an extension to the Homologous Structure Alignment Database (HOMSTRAD; Mizuguchi et al., Protein Sci., 7, 2469-2471, 1998a) to include homologous sequences derived from the protein families database Pfam (Bateman et al., Nucleic Acids Res., 28, 263-266, 2000). HOMSTRAD is integrated with the server FUGUE (Shi et al., submitted, 2001) for recognition and alignment of homologues, benefitting from the combination of abundant sequence information and accurate structure-based alignments. AVAILABILITY The HOMSTRAD database is available at: http://www-cryst.bioc.cam.ac.uk/homstrad/. Query sequences can be submitted to the homology recognition/alignment server FUGUE at: http://www-cryst.bioc.cam.ac.uk/fugue/.
Paul I. W. de Bakker, Alex Bateman, David F. Burke, Ricardo Núñez Miguel, Kenji Mizuguchi, Jiye Shi, Hiroki Shirai, Tom L. Blundell
Bioinform.1