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

Evan Mauceli

dblp:82/8090 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2015
—ORCID · none

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

Applied, interdisciplinary, general and emerging computing · 2Databases, data management, data science and information retrieval · 1

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%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Parallel and multicore computing · 100%

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology
sequence alignment
0.322012
Massive Genomic Data Processing and Deep Analysis · Proc. VLDB Endow. 2012
Genome-wide synteny through highly sensitive sequence alignment: Satsuma · Bioinform. 2010
Bioinformatics and computational biology
biological data visualization
0.212015
Whiteboard: a framework for the programmatic visualization of complex biological analyses · Bioinform. 2015
Bioinformatics and computational biology › genomics
genomic data analysis
0.112012
Massive Genomic Data Processing and Deep Analysis · Proc. VLDB Endow. 2012
Bioinformatics and computational biology
comparative genomics
0.112010
Genome-wide synteny through highly sensitive sequence alignment: Satsuma · Bioinform. 2010
Bioinformatics and computational biology › sequence alignment
genome alignment
0.112010
Genome-wide synteny through highly sensitive sequence alignment: Satsuma · Bioinform. 2010
Bioinformatics and computational biology › sequence alignment
maximal exact match
0.112010
Genome-wide synteny through highly sensitive sequence alignment: Satsuma · Bioinform. 2010
Bioinformatics and computational biology
sequence analysis
0.112010
Genome-wide synteny through highly sensitive sequence alignment: Satsuma · Bioinform. 2010
Bioinformatics and computational biology › sequence alignment › genome alignment
whole-genome alignment
0.112010
Genome-wide synteny through highly sensitive sequence alignment: Satsuma · Bioinform. 2010
Parallel and multicore computing
parallel computing
0.012012
Massive Genomic Data Processing and Deep Analysis · Proc. VLDB Endow. 2012

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

quality control · 0.3visualization-computation coupling · 0.2fast fourier transform · 0.1cross-correlation · 0.1
YearPublicationVenuePosition
2015 Whiteboard: a framework for the programmatic visualization of complex biological analyses
abstract
UNLABELLED: Whiteboard is a class library implemented in C++ that enables visualization to be tightly coupled with computation when analyzing large and complex datasets. AVAILABILITY AND IMPLEMENTATION: the C++ source code, coding samples and documentation are freely available under the Lesser General Public License from http://whiteboard-class.sourceforge.net/.
Görel Sundström, Neda Zamani, Manfred G. Grabherr, Evan Mauceli
Bioinform.4
2012 Massive Genomic Data Processing and Deep Analysis
abstract
Today large sequencing centers are producing genomic data at the rate of 10 terabytes a day and require complicated processing to transform massive amounts of noisy raw data into biological information. To address these needs, we develop a system for end-to-end processing of genomic data, including alignment of short read sequences, variation discovery, and deep analysis. We also employ a range of quality control mechanisms to improve data quality and parallel processing techniques for performance. In the demo, we will use real genomic data to show details of data transformation through the workflow, the usefulness of end results (ready for use as testable hypotheses), the effects of our quality control mechanisms and improved algorithms, and finally performance improvement.
Abhishek Roy 0008, Yanlei Diao, Evan Mauceli, Yiping Shen, Bai-Lin Wu
Proc. VLDB Endow.3
2010 Genome-wide synteny through highly sensitive sequence alignment: Satsuma
abstract
MOTIVATION: Comparative genomics heavily relies on alignments of large and often complex DNA sequences. From an engineering perspective, the problem here is to provide maximum sensitivity (to find all there is to find), specificity (to only find real homology) and speed (to accommodate the billions of base pairs of vertebrate genomes). RESULTS: Satsuma addresses all three issues through novel strategies: (i) cross-correlation, implemented via fast Fourier transform; (ii) a match scoring scheme that eliminates almost all false hits; and (iii) an asynchronous 'battleship'-like search that allows for aligning two entire fish genomes (470 and 217 Mb) in 120 CPU hours using 15 processors on a single machine. AVAILABILITY: Satsuma is part of the Spines software package, implemented in C++ on Linux. The latest version of Spines can be freely downloaded under the LGPL license from http://www.broadinstitute.org/science/programs/genome-biology/spines/.
Manfred G. Grabherr, Pamela H. Russell, Miriah D. Meyer, Evan Mauceli, Jessica Alföldi, Federica Di Palma, Kerstin Lindblad-Toh
Bioinform.4