A Review of Recent Alignment-Free Clustering Algorithms in Expressed Sequence Tag

K. Ng, S. Phon-Amnuaisuk, C. Ho
{"title":"A Review of Recent Alignment-Free Clustering Algorithms in Expressed Sequence Tag","authors":"K. Ng, S. Phon-Amnuaisuk, C. Ho","doi":"10.1109/SOCPAR.2009.18","DOIUrl":null,"url":null,"abstract":"Expressed sequence tags (ESTs) are short single pass sequence reads derived from cDNA libraries, they have been used for gene discovery, detection of splice variants, expression of genes and also transciptome analysis. Clustering of ESTs is a vital step before they can be processed further. Currently there are many EST clustering algorithms available. Basically they can be generalized into two broad approaches, i.e. alignment-based and alignment-free. The former approach is reliable but inefficient in terms of running time, while the latter approach is gaining popularity and currently under rapid development due to its faster speed and acceptable result. In this paper, we propose a taxonomy for sequence comparison algorithms and another taxonomy for EST clustering algorithms. In addition, we also highlight the peculiarities of recently introduced alignment-free EST clustering algorithms by focusing on their features, distance measures, advantages and disadvantages.","PeriodicalId":284743,"journal":{"name":"2009 International Conference of Soft Computing and Pattern Recognition","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 International Conference of Soft Computing and Pattern Recognition","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SOCPAR.2009.18","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Expressed sequence tags (ESTs) are short single pass sequence reads derived from cDNA libraries, they have been used for gene discovery, detection of splice variants, expression of genes and also transciptome analysis. Clustering of ESTs is a vital step before they can be processed further. Currently there are many EST clustering algorithms available. Basically they can be generalized into two broad approaches, i.e. alignment-based and alignment-free. The former approach is reliable but inefficient in terms of running time, while the latter approach is gaining popularity and currently under rapid development due to its faster speed and acceptable result. In this paper, we propose a taxonomy for sequence comparison algorithms and another taxonomy for EST clustering algorithms. In addition, we also highlight the peculiarities of recently introduced alignment-free EST clustering algorithms by focusing on their features, distance measures, advantages and disadvantages.
表达序列标记中无对齐聚类算法的研究进展
表达序列标签(est)是从cDNA文库中提取的短单通序列,已被用于基因发现、剪接变异检测、基因表达和转录组分析。在进一步处理无害环境技术之前,对它们进行聚类是至关重要的一步。目前有许多EST聚类算法可用。基本上,它们可以概括为两种广泛的方法,即基于对齐和不对齐。前一种方法可靠,但在运行时间上效率低下,而后一种方法由于速度更快,结果可接受,正在得到普及和快速发展。在本文中,我们提出了序列比较算法的分类和EST聚类算法的分类。此外,我们还强调了最近引入的无对齐EST聚类算法的特点,重点关注它们的特征,距离度量,优点和缺点。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信