title: SPA: a short peptide assembler for metagenomic data.
abstract: The metagenomic paradigm allows for an understanding of the metabolic and functional potential of microbes in a community via a study of their proteins. The substrate for protein identification is either the set of individual nucleotide reads generated from metagenomic samples or the set of contig sequences produced by assembling these reads. However, a read-based strategy using reads generated by next-generation sequencing (NGS) technologies, results in an overwhelming majority of partial-length protein predictions. A nucleotide assembly-based strategy does not fare much better, as metagenomic assemblies are typically fragmented and also leave a large fraction of reads unassembled. Here, we present a method for reconstructing complete protein sequences directly from NGS metagenomic data. Our framework is based on a novel short peptide assembler (SPA) that assembles protein sequences from their constituent peptide fragments identified on short reads. The SPA algorithm is based on informed traversals of a de Bruijn graph, defined on an amino acid alphabet, to identify probable paths that correspond to proteins. Using large simulated and real metagenomic data sets, we show that our method outperforms the alternate approach of identifying genes on nucleotide sequence assemblies and generates longer protein sequences that can be more effectively analysed.
authors: Informatics Department, J. Craig Venter Institute, San Diego, CA 92121, USA.
authors: Youngik
authors: Y
authors: Yang
authors: Shibu
authors: S
authors: Yooseph
mesh_terms: D000465:Algorithms; D059014:High-Throughput Nucleotide Sequencing; D056186:Metagenomics / Q000379:methods*; D010455:Peptides / Q000737:chemistry; D012680:Sensitivity and Specificity; D020539:Sequence Analysis, Protein / Q000379:methods*
chemical_list: D010455:Peptides