سامانه پشتیبانی خدمات اطلاعات

  اخبار و اعلانات

 آمار

تعداد نشریات162
تعداد شماره‌ها6,623
تعداد مقالات71,544
تعداد مشاهده مقاله126,888,483
تعداد دریافت فایل اصل مقاله99,933,430
Saadat, Samaneh, Safikhani, Zhaleh, Badie, Kambiz, Sadeghi, Mehdi. (1393). Clustering of Short Read Sequences for de novo Transcriptome Assembly. , 4(1), 43-52. doi: 10.22059/pbs.2014.50305
Samaneh Saadat; Zhaleh Safikhani; Kambiz Badie; Mehdi Sadeghi. "Clustering of Short Read Sequences for de novo Transcriptome Assembly". , 4, 1, 1393, 43-52. doi: 10.22059/pbs.2014.50305
Saadat, Samaneh, Safikhani, Zhaleh, Badie, Kambiz, Sadeghi, Mehdi. (1393). 'Clustering of Short Read Sequences for de novo Transcriptome Assembly', , 4(1), pp. 43-52. doi: 10.22059/pbs.2014.50305
Saadat, Samaneh, Safikhani, Zhaleh, Badie, Kambiz, Sadeghi, Mehdi. Clustering of Short Read Sequences for de novo Transcriptome Assembly. , 1393; 4(1): 43-52. doi: 10.22059/pbs.2014.50305

Clustering of Short Read Sequences for de novo Transcriptome Assembly

Progress in Biological Sciences
مقاله 3، دوره 4، شماره 1، مرداد 2014، صفحه 43-52    اصل مقاله (596.02 K)
نوع مقاله: Original Research Papers
شناسه دیجیتال (DOI): 10.22059/pbs.2014.50305
نویسندگان
Samaneh Saadat1؛ Zhaleh Safikhani2؛ Kambiz Badie3؛ Mehdi Sadeghi* 4
1Department of Algorithms and Computation, University of Tehran, Tehran, Iran
2Institute of Biochemistry and Biophysics, University of Tehran, Tehran, Iran
3National Telecom Research Center, Tehran, Iran
4National Institute of Genetic Engineering and Biotechnology (NIGEB), Tehran 14155-6346, Iran.
چکیده
Given the importance of transcriptome analysis in various biological studies and considering the
vast amount of whole transcriptome sequencing data, it seems necessary to develop an
algorithm to assemble transcriptome data. In this study we propose an algorithm for
transcriptome assembly in the absence of a reference genome. First, the contiguous sequences
are generated using de Bruijn graph with different k-mer lengths. Then, the eclectic mixtures of
sequences are gathered in order to form the final sequences. Lastly, the contiguous sequences
are clustered and the isoform groups are provided. This proposed algorithm is capable of
generating long contiguous sequences and accurately clustering them into isoform groups.To
evaluate our algorithm, we applied it to a simulated RNA-seq dataset of rat transcriptome and a
real RNA-seq experiment of the loricaria gr. cataphracta transcriptome. The correctness of the
assembled contigs was more than 95%, and our algorithm was able to reconstruct over 70% of
the transcripts at more than 80% of the transcripts’ lengths. This study demonstrates that
applying a sophisticated merging method improves transcriptome assembly. The source code is
available upon request by contacting the corresponding author by email.
 
کلیدواژه‌ها
De novo؛ Next generation sequencing؛ RNA-Seq؛ transcriptome assembly
آمار
تعداد مشاهده مقاله: 2,008
تعداد دریافت فایل اصل مقاله: 1,577





سامانه مدیریت نشریات علمی. قدرت گرفته از سیناوب