Article
A memory-efficient algorithm to obtain splicing graphs and de novo expression estimates from de Bruijn graphs of RNA-Seq data.
BMC genomics - 1 Jan 2014
Sze Sing-Hoi, Tarone Aaron M
Abstract excerpt
BACKGROUND: The recent advance of high-throughput sequencing makes it feasible to study entire transcriptomes through the application of de novo sequence assembly algorithms. While a popular strategy is to first construct an intermediate de Bruijn graph structure to represent the transcriptome, an additional step is needed to construct predicted transcripts from the graph. RESULTS: Since the de Bruijn graph...
Read the complete abstract on PubMedTopics
Share this publication in a Topic to start or enrich a Post.
