New class of gene-termini-associated human RNAs suggests a novel RNA copying mechanism.

Small (<200 nucleotide) RNA (sRNA) profiling of human cells using various technologies demonstrates unexpected complexity of sRNAs with hundreds of thousands of sRNA species present. Genetic and in vitro studies show that these RNAs are not merely degradation products of longer transcripts but could indeed have a function. Furthermore, profiling of RNAs, including the sRNAs, can reveal not only novel transcripts, but also make clear predictions about the existence and properties of novel biochemical pathways operating in a cell. For example, sRNA profiling in human cells indicated the existence of an unknown capping mechanism operating on cleaved RNA, a biochemical component of which was later identified. Here we show that human cells contain a novel type of sRNA that has non-genomically encoded 5' poly(U) tails. The presence of these RNAs at the termini of genes, specifically at the very 3' ends of known mRNAs, strongly argues for the presence of a yet uncharacterized endogenous biochemical pathway in cells that can copy RNA. We show that this pathway can operate on multiple genes, with specific enrichment towards transcript-encoding components of the translational machinery. Finally, we show that genes are also flanked by sense, 3' polyadenylated sRNAs that are likely to be capped.

Error tolerant indexing and alignment of short reads with covering template families.

The rapid adoption of high-throughput next generation sequence data in biological research is presenting a major challenge for sequence alignment tools­specifically, the efficient alignment of vast amounts of short reads to large references in the presence of differences arising from sequencing errors and biological sequence variations. To address this challenge, we developed a short read aligner for high-throughput sequencer data that is tolerant of errors or mutations of all types­namely, substitutions, deletions, and insertions. The aligner utilizes a multi-stage approach in which template-based indexing is used to identify candidate regions for alignment with dynamic programming. A template is a pair of gapped seeds, with one used with the read and one used with the reference. In this article, we focus on the development of template families that yield error-tolerant indexing up to a given error-budget. A general algorithm for finding those families is presented, and a recursive construction that creates families with higher error tolerance from ones with a lower error tolerance is developed.