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

André Schumacher

dblp:90/5927 · DBLP profile ↗
← Back
9ranked-venue papers
4as first author
0since 2021 · last 2014
—ORCID · none

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

Computer networks · 3 · 1 first-authorTheory of computation · 2Applied, interdisciplinary, general and emerging computing · 2 · 1 first-authorSecurity and privacy · 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%
Computer architecture, parallel and distributed computing, and storage systems
2 papers
Parallel and multicore computing · 64% Distributed systems · 36%

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › sequence analysis
sequencing data analysis
0.212014
SeqPig: simple and scalable scripting for large sequencing data sets in Hadoop · Bioinform. 2014
Bioinformatics and computational biology › genomics
next-generation sequencing data analysis
0.112012
Hadoop-BAM: directly manipulating next generation sequencing data in the cloud · Bioinform. 2012
Parallel and multicore computing › data-parallel programming
mapreduce
0.122014
SeqPig: simple and scalable scripting for large sequencing data sets in Hadoop · Bioinform. 2014
Hadoop-BAM: directly manipulating next generation sequencing data in the cloud · Bioinform. 2012
Distributed systems
distributed data processing
0.112014
SeqPig: simple and scalable scripting for large sequencing data sets in Hadoop · Bioinform. 2014

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

hadoop mapreduce · 0.4apache pig · 0.4mapreduce · 0.3
YearPublicationVenuePosition
2014 SeqPig: simple and scalable scripting for large sequencing data sets in Hadoop
abstract
SUMMARY: Hadoop MapReduce-based approaches have become increasingly popular due to their scalability in processing large sequencing datasets. However, as these methods typically require in-depth expertise in Hadoop and Java, they are still out of reach of many bioinformaticians. To solve this problem, we have created SeqPig, a library and a collection of tools to manipulate, analyze and query sequencing datasets in a scalable and simple manner. SeqPigscripts use the Hadoop-based distributed scripting engine Apache Pig, which automatically parallelizes and distributes data processing tasks. We demonstrate SeqPig's scalability over many computing nodes and illustrate its use with example scripts. AVAILABILITY AND IMPLEMENTATION: Available under the open source MIT license at http://sourceforge.net/projects/seqpig/
André Schumacher, Luca Pireddu, Matti Niemenmaa, Aleksi Kallio, Eija Korpelainen, Gianluigi Zanetti, Keijo Heljanko
Bioinform.1
2013 Approximately Uniform Online Checkpointing with Bounded Memory
Lauri Ahlroth, Olli Pottonen, André Schumacher
Algorithmica3
2012 Hadoop-BAM: directly manipulating next generation sequencing data in the cloud
abstract
Abstract Summary: Hadoop-BAM is a novel library for the scalable manipulation of aligned next-generation sequencing data in the Hadoop distributed computing framework. It acts as an integration layer between analysis applications and BAM files that are processed using Hadoop. Hadoop-BAM solves the issues related to BAM data access by presenting a convenient API for implementing map and reduce functions that can directly operate on BAM records. It builds on top of the Picard SAM JDK, so tools that rely on the Picard API are expected to be easily convertible to support large-scale distributed processing. In this article we demonstrate the use of Hadoop-BAM by building a coverage summarizing tool for the Chipster genome browser. Our results show that Hadoop offers good scalability, and one should avoid moving data in and out of Hadoop between analysis steps. Availability: Available under the open-source MIT license at http://sourceforge.net/projects/hadoop-bam/ Contact: [email protected] Supplementary information: Supplementary material is available at Bioinformatics online.
Matti Niemenmaa, Aleksi Kallio, André Schumacher, Petri Klemelä, Eija Korpelainen, Keijo Heljanko
Bioinform.3
2011 Approximately Uniform Online Checkpointing
Lauri Ahlroth, Olli Pottonen, André Schumacher
COCOON3
2010 Distributed algorithms for lifetime maximization in sensor networks via Min-Max spanning subgraphs
Harri Haanpää, André Schumacher, Pekka Orponen
Wirel. Networks2
2009 Distributed Sleep Scheduling in Wireless Sensor Networks via Fractional Domatic Partitioning
André Schumacher, Harri Haanpää
SSS1
2008 Lifetime Maximization in Wireless Sensor Networks by Distributed Binary Search
André Schumacher, Pekka Orponen, Thorn Thaler, Harri Haanpää
EWSN1
2007 Distributed Computation of Maximum Lifetime Spanning Subgraphs in Sensor Networks
Harri Haanpää, André Schumacher, Thorn Thaler, Pekka Orponen
MSN2
2006 Load Balancing by Distributed Optimisation in Ad Hoc Networks
André Schumacher, Harri Haanpää, Satu Elisa Schaeffer, Pekka Orponen
MSN1