MinIsoClust

S. Behera, J. Deogun, E. Moriyama
{"title":"MinIsoClust","authors":"S. Behera, J. Deogun, E. Moriyama","doi":"10.1145/3388440.3412424","DOIUrl":null,"url":null,"abstract":"With the advent of next-generation sequencing technologies, computational transcriptome assembly of RNA-Seq data has become a critical step in many biological and biomedical studies. The accuracy of these transcriptome assembly methods is hindered by the presence of alternatively spliced transcripts (isoforms). Identifying and quantifying isoforms is also essential in understanding complex biological functions, many of which are often associated with various diseases. However, clustering of isoform sequences using only sequence identities when quality reference genomes are not available is often difficult due to heterogeneous exon composition among isoforms. Clustering of a large number of transcript sequences also requires a scalable technique. In this study, we propose a minwise-hashing based method, MinIsoClust, for fast and accurate clustering of transcript sequences that can be used to identify groups of isoforms. We tested this new method using simulated datasets. The results demonstrated that MinIso-Clust was more accurate than CD-HIT-EST, isONclust, and MM-seqs2/Linclust. MinIsoClust also performed better than isONclust and MMseqs2/Linclust in terms of computational time and space efficiency. The source codes of MinIsoClust is freely available at https://github.com/srbehera/MinIsoClust.","PeriodicalId":411338,"journal":{"name":"Proceedings of the 11th ACM International Conference on Bioinformatics, Computational Biology and Health Informatics","volume":"55 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"MinIsoClust\",\"authors\":\"S. Behera, J. Deogun, E. Moriyama\",\"doi\":\"10.1145/3388440.3412424\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"With the advent of next-generation sequencing technologies, computational transcriptome assembly of RNA-Seq data has become a critical step in many biological and biomedical studies. The accuracy of these transcriptome assembly methods is hindered by the presence of alternatively spliced transcripts (isoforms). Identifying and quantifying isoforms is also essential in understanding complex biological functions, many of which are often associated with various diseases. However, clustering of isoform sequences using only sequence identities when quality reference genomes are not available is often difficult due to heterogeneous exon composition among isoforms. Clustering of a large number of transcript sequences also requires a scalable technique. In this study, we propose a minwise-hashing based method, MinIsoClust, for fast and accurate clustering of transcript sequences that can be used to identify groups of isoforms. We tested this new method using simulated datasets. The results demonstrated that MinIso-Clust was more accurate than CD-HIT-EST, isONclust, and MM-seqs2/Linclust. MinIsoClust also performed better than isONclust and MMseqs2/Linclust in terms of computational time and space efficiency. The source codes of MinIsoClust is freely available at https://github.com/srbehera/MinIsoClust.\",\"PeriodicalId\":411338,\"journal\":{\"name\":\"Proceedings of the 11th ACM International Conference on Bioinformatics, Computational Biology and Health Informatics\",\"volume\":\"55 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-09-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 11th ACM International Conference on Bioinformatics, Computational Biology and Health Informatics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3388440.3412424\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 11th ACM International Conference on Bioinformatics, Computational Biology and Health Informatics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3388440.3412424","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文章由计算机程序翻译,如有差异,请以英文原文为准。
MinIsoClust
With the advent of next-generation sequencing technologies, computational transcriptome assembly of RNA-Seq data has become a critical step in many biological and biomedical studies. The accuracy of these transcriptome assembly methods is hindered by the presence of alternatively spliced transcripts (isoforms). Identifying and quantifying isoforms is also essential in understanding complex biological functions, many of which are often associated with various diseases. However, clustering of isoform sequences using only sequence identities when quality reference genomes are not available is often difficult due to heterogeneous exon composition among isoforms. Clustering of a large number of transcript sequences also requires a scalable technique. In this study, we propose a minwise-hashing based method, MinIsoClust, for fast and accurate clustering of transcript sequences that can be used to identify groups of isoforms. We tested this new method using simulated datasets. The results demonstrated that MinIso-Clust was more accurate than CD-HIT-EST, isONclust, and MM-seqs2/Linclust. MinIsoClust also performed better than isONclust and MMseqs2/Linclust in terms of computational time and space efficiency. The source codes of MinIsoClust is freely available at https://github.com/srbehera/MinIsoClust.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信