SEQanswers

Go Back   SEQanswers > Literature Watch



Similar Threads
Thread Thread Starter Forum Replies Last Post
Bowtie, an ultrafast, memory-efficient, open source short read aligner Ben Langmead Bioinformatics 514 03-13-2020 04:57 AM
PubMed: Graph-based clustering and characterization of repetitive sequences in next-g Newsbot! Literature Watch 1 10-31-2012 04:10 AM
PubMed: De novo assembly of human genomes with massively parallel short read sequenci Newsbot! Literature Watch 0 12-19-2009 03:13 AM
Efficient frequency-based de novo short-read clustering for error trimming in NGS strob Literature Watch 0 07-02-2009 02:37 AM
PubMed: Velvet: Algorithms for De Novo Short Read Assembly Using De Bruijn Graphs. Newsbot! Literature Watch 0 03-20-2008 06:24 AM

Reply
 
Thread Tools
Old 05-15-2009, 06:00 AM   #1
Newsbot!
RSS Posting Maniac
 

Join Date: Feb 2008
Posts: 1,443
Default PubMed: Efficient frequency-based de novo short read clustering for error trimming in

Syndicated from PubMed RSS Feeds

Related Articles Efficient frequency-based de novo short read clustering for error trimming in next-generation sequencing.

Genome Res. 2009 May 13;

Authors: Qu W, Hashimoto SI, Mori****a S

Novel massively parallel sequencing technologies provide highly detailed structures of transcriptomes and genomes by yielding deep coverage of short reads, but their utility is limited by inadequate sequencing quality and short read lengths. Sequencing-error trimming in short reads is therefore a vital process that could improve the rate of successful reference mapping and polymorphism detection. Toward this aim, we herein report a frequency-based, de novo short-read clustering method that organizes erroneous short sequences originating in a single abundant sequence into a tree structure; in this structure, each child sequence is considered to be stochastically derived from its more abundant parent sequence with one mutation through sequencing errors. The root node is the most frequently observed sequence that represents all erroneous reads in the entire tree, allowing the alignment of the reliable representative read to the genome without the risk of mapping erroneous reads to false-positive positions. This method complements base calling and the error correction of making direct alignments with the reference genome, and is able to improve the overall accuracy of short-read alignment by consulting the inherent relationships among the entire set of reads. The algorithm runs efficiently with a linear time complexity. In addition, an error rate evaluation model can be derived from bacterial artificial chromosome sequencing data obtained in the same run as a control. In two clustering experiments using small RNA and 5'-end mRNA reads data sets, we confirmed a remarkable increase (~5%) in the percentage of short reads aligned to the reference sequence.

PMID: 19439514 [PubMed - as supplied by publisher]



More...
Newsbot! is offline   Reply With Quote
Reply

Thread Tools

Posting Rules
You may not post new threads
You may not post replies
You may not post attachments
You may not edit your posts

BB code is On
Smilies are On
[IMG] code is On
HTML code is Off




All times are GMT -8. The time now is 06:42 PM.


Powered by vBulletin® Version 3.8.9
Copyright ©2000 - 2021, vBulletin Solutions, Inc.
Single Sign On provided by vBSSO