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.

Gregory G. Faust

dblp:119/6518 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 2014
0000-0002-8233-9408ORCID · corroborated

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

Applied, interdisciplinary, general and emerging computing · 2 · 2 first-authorSystems, architecture and hardware · 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%

Topics — the 4 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › sequence analysis › sequencing read preprocessing
duplicate marking
0.212014
SAMBLASTER: fast duplicate marking and structural variant read extraction · Bioinform. 2014
Bioinformatics and computational biology › sequence analysis › read mapping
long-read alignment
0.112012
YAHA: fast and flexible long-read alignment with optimal breakpoint detection · Bioinform. 2012
Bioinformatics and computational biology
sequence alignment
0.112012
YAHA: fast and flexible long-read alignment with optimal breakpoint detection · Bioinform. 2012
Bioinformatics and computational biology › genomics › structural variation
structural variant detection
0.112012
YAHA: fast and flexible long-read alignment with optimal breakpoint detection · Bioinform. 2012

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

piped post-pass processing · 0.2hash-based alignment · 0.1directed acyclic graph · 0.1breakpoint detection · 0.1
YearPublicationVenuePosition
2014 SAMBLASTER: fast duplicate marking and structural variant read extraction
abstract
MOTIVATION: Illumina DNA sequencing is now the predominant source of raw genomic data, and data volumes are growing rapidly. Bioinformatic analysis pipelines are having trouble keeping pace. A common bottleneck in such pipelines is the requirement to read, write, sort and compress large BAM files multiple times. RESULTS: We present SAMBLASTER, a tool that reduces the number of times such costly operations are performed. SAMBLASTER is designed to mark duplicates in read-sorted SAM files as a piped post-pass on DNA aligner output before it is compressed to BAM. In addition, it can simultaneously output into separate files the discordant read-pairs and/or split-read mappings used for structural variant calling. As an alignment post-pass, its own runtime overhead is negligible, while dramatically reducing overall pipeline complexity and runtime. As a stand-alone duplicate marking tool, it performs significantly better than PICARD or SAMBAMBA in terms of both speed and memory usage, while achieving nearly identical results. AVAILABILITY AND IMPLEMENTATION: SAMBLASTER is open-source C+ + code and freely available for download from https://github.com/GregoryFaust/samblaster.
Gregory G. Faust, Ira M. Hall
Bioinform.1
2012 ArchFP: Rapid prototyping of pre-RTL floorplans
Gregory G. Faust, Runjie Zhang, Kevin Skadron, Mircea R. Stan, Brett H. Meyer
VLSI-SoC1
2012 YAHA: fast and flexible long-read alignment with optimal breakpoint detection
abstract
MOTIVATION: With improved short-read assembly algorithms and the recent development of long-read sequencers, split mapping will soon be the preferred method for structural variant (SV) detection. Yet, current alignment tools are not well suited for this. RESULTS: We present YAHA, a fast and flexible hash-based aligner. YAHA is as fast and accurate as BWA-SW at finding the single best alignment per query and is dramatically faster and more sensitive than both SSAHA2 and MegaBLAST at finding all possible alignments. Unlike other aligners that report all, or one, alignment per query, or that use simple heuristics to select alignments, YAHA uses a directed acyclic graph to find the optimal set of alignments that cover a query using a biologically relevant breakpoint penalty. YAHA can also report multiple mappings per defined segment of the query. We show that YAHA detects more breakpoints in less time than BWA-SW across all SV classes, and especially excels at complex SVs comprising multiple breakpoints. AVAILABILITY: YAHA is currently supported on 64-bit Linux systems. Binaries and sample data are freely available for download from http://faculty.virginia.edu/irahall/YAHA. CONTACT: [email protected].
Gregory G. Faust, Ira M. Hall
Bioinform.1