UNLABELLED
The determination of protein sequences from a metagenomic dataset enables the study of metabolism and functional roles of the organisms that are present in the sampled microbial community. We had previously introduced algorithm and software for the accurate reconstruction of protein sequences from short peptides identified on nucleotide reads in a metagenomic dataset. Here, we present significant computational improvements to the short peptide assembly algorithm that make it practical to reconstruct proteins from large metagenomic datasets containing several hundred million reads, while maintaining accuracy. The improved computational efficiency is achieved using a suffix array data structure that allows for fast querying during the assembly process, and a significant redesign of assembly steps that enables multi-threaded execution.
AVAILABILITY AND IMPLEMENTATION
The program is available under the GPLv3 license from sourceforge.net/projects/spa-assembler.
[1]
Hiroki Arimura,et al.
Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications
,
2001,
CPM.
[2]
Michael S. Waterman,et al.
A New Algorithm for DNA Sequence Assembly
,
1995,
J. Comput. Biol..
[3]
Eugene W. Myers,et al.
Suffix arrays: a new method for on-line string searches
,
1993,
SODA '90.
[4]
R. Daniel,et al.
Metagenomic Analyses: Past and Future Trends
,
2010,
Applied and Environmental Microbiology.
[5]
Shibu Yooseph,et al.
SPA: a short peptide assembler for metagenomic data
,
2013,
Nucleic acids research.