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

Towfique Raj

dblp:22/498 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
1since 2021 · last 2022
—ORCID · unresolved

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
2 papers
Bioinformatics and computational biology · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
High-performance computing · 100%

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › statistical genetics › fine-mapping
causal variant identification
0.612022
echolocatoR: an automated end-to-end statistical and functional genomic fine-mapping pipeline · Bioinform. 2022
Bioinformatics and computational biology › statistical genetics
fine-mapping
0.612022
echolocatoR: an automated end-to-end statistical and functional genomic fine-mapping pipeline · Bioinform. 2022
Bioinformatics and computational biology
functional genomics
0.612022
echolocatoR: an automated end-to-end statistical and functional genomic fine-mapping pipeline · Bioinform. 2022
Bioinformatics and computational biology › biostatistics › statistical bioinformatics
statistical genomics
0.612022
echolocatoR: an automated end-to-end statistical and functional genomic fine-mapping pipeline · Bioinform. 2022
Bioinformatics and computational biology
genomics
0.012004
me-PCR: a refined ultrafast algorithm for identifying sequence-defined genomic elements · Bioinform. 2004
Bioinformatics and computational biology › sequence analysis
in silico PCR
0.012004
me-PCR: a refined ultrafast algorithm for identifying sequence-defined genomic elements · Bioinform. 2004
Bioinformatics and computational biology
sequence analysis
0.012004
me-PCR: a refined ultrafast algorithm for identifying sequence-defined genomic elements · Bioinform. 2004
Bioinformatics and computational biology › sequence analysis › sequence similarity search
sequence database search
0.012004
me-PCR: a refined ultrafast algorithm for identifying sequence-defined genomic elements · Bioinform. 2004

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

quantitative trait loci · 0.6linkage disequilibrium · 0.6epigenomics · 0.6string matching · 0.1multithreading · 0.1
YearPublicationVenuePosition
2022 echolocatoR: an automated end-to-end statistical and functional genomic fine-mapping pipeline
abstract
SUMMARY: echolocatoR integrates a diverse suite of statistical and functional fine-mapping tools to identify, test enrichment in, and visualize high-confidence causal consensus variants in any phenotype. It requires minimal input from users (a summary statistics file), can be run in a single R function, and provides extensive access to relevant datasets (e.g. reference linkage disequilibrium panels, quantitative trait loci, genome-wide annotations, cell-type-specific epigenomics), thereby enabling rapid, robust and scalable end-to-end fine-mapping investigations. AVAILABILITY AND IMPLEMENTATION: echolocatoR is an open-source R package available through GitHub under the GNU General Public License (Version 3) license: https://github.com/RajLabMSSM/echolocatoR. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Brian M. Schilder, Jack Humphrey, Towfique Raj
Bioinform.3
2004 me-PCR: a refined ultrafast algorithm for identifying sequence-defined genomic elements
abstract
Abstract Summary: We have adapted the originally described electronic PCR (e-PCR) algorithm to perform string searches more accurately and much more rapidly than previously possible. Our implementation [multithreaded e-PCR (me-PCR)] runs sufficiently fast to allow even desktop machines to query quickly large genomes with very large genomic element sets. In addition, me-PCR is multithreaded, interprets all IUPAC nucleotide symbols, allows searches with elements specified by long sequences (such as SNPs), accepts ranges in the expected PCR size input field, requires substantially less memory for analysis of large sequences and corrects a number of minor flaws causing misreporting of hits in exceptional cases. Thus, me-PCR provides increased annotation capabilities for complex genomes to non-expert laboratories. Availability: me-PCR has been compiled for Linux, Solaris, AIX, Windows and Macintosh platforms. Both source and executable code are freely available to the research community at http://genome.chop.edu/mePCR/
Kevin Murphy 0005, Towfique Raj, R. Scott Winters, Peter S. White
Bioinform.2