CLUSTERING OF SHORT READ SEQUENCES FOR DE NOVO TRANSCRIPTOME ASSEMBLY

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

SAADAT SAMANEH; SAFIKHANI ZHALEH; BADIE KAMBIZ; SADEGHI MEHDI

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: PROGRESS IN BIOLOGICAL SCIENCES Year:2014 | Volume:4 | Issue:1 Page(s): 43-52

Download Full-Text

View:

436

Download:

132

Cites:

Information Journal Paper

Title

CLUSTERING OF SHORT READ SEQUENCES FOR DE NOVO TRANSCRIPTOME ASSEMBLY

Author(s)

SAADAT SAMANEH | SAFIKHANI ZHALEH | BADIE KAMBIZ | SADEGHI MEHDI | Issue Writer Certificate

Keywords

DE NOVO

NEXT GENERATION SEQUENCING

RNA-SEQ

TRANSCRIPTOME ASSEMBLY

Abstract

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.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

SAADAT, SAMANEH, SAFIKHANI, ZHALEH, BADIE, KAMBIZ, & SADEGHI, MEHDI. (2014). CLUSTERING OF SHORT READ SEQUENCES FOR DE NOVO TRANSCRIPTOME ASSEMBLY. PROGRESS IN BIOLOGICAL SCIENCES, 4(1), 43-52. SID. https://sid.ir/paper/331216/en

Vancouver: Copy

SAADAT SAMANEH, SAFIKHANI ZHALEH, BADIE KAMBIZ, SADEGHI MEHDI. CLUSTERING OF SHORT READ SEQUENCES FOR DE NOVO TRANSCRIPTOME ASSEMBLY. PROGRESS IN BIOLOGICAL SCIENCES[Internet]. 2014;4(1):43-52. Available from: https://sid.ir/paper/331216/en

IEEE: Copy

SAMANEH SAADAT, ZHALEH SAFIKHANI, KAMBIZ BADIE, and MEHDI SADEGHI, “CLUSTERING OF SHORT READ SEQUENCES FOR DE NOVO TRANSCRIPTOME ASSEMBLY,” PROGRESS IN BIOLOGICAL SCIENCES, vol. 4, no. 1, pp. 43–52, 2014, [Online]. Available: https://sid.ir/paper/331216/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops