Journal ArticleOPEN ACCESS

Seal: A distributed short read mapping and duplicate removal tool

Bioinformatics (2011) 27(15) 2159-2160
DOI: 10.1093/bioinformatics/btr325
113Citations
Citations of this article
148Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Summary: SEAL is a scalable tool for short read pair mapping and duplicate removal. It computes mappings that are consistent with those produced by BWA and removes duplicates according to the same criteria employed by Picard MarkDuplicates. On a 16-node Hadoop cluster, it is capable of processing about 13 GB per hour in map+rmdup mode, while reaching a throughput of 19 GB per hour in mapping-only mode. © The Author(s) 2011. Published by Oxford University Press.

Cite

CITATION STYLE

APA

Pireddu, L., Leo, S., & Zanetti, G. (2011). Seal: A distributed short read mapping and duplicate removal tool. Bioinformatics, 27(15), 2159–2160. https://doi.org/10.1093/bioinformatics/btr325

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free