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


Ng, Keng-Hoong and Phon-Amnuaisuk,, Somnuk and Ho, Chin-Kuan (2009) A Review of Recent Alignment-Free Clustering Algorithms in Expressed Sequence Tag. In: International Conference of Soft Computing and Pattern Recognition, 2009. SOCPAR '09. IEEE, pp. 25-30. ISBN 978-1-4244-5330-6

[img] Text
05368607.pdf - Published Version
Restricted to Repository staff only

Download (392kB)


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.

Item Type: Book Section
Subjects: T Technology > T Technology (General)
Divisions: Faculty of Information Science and Technology (FIST)
Depositing User: Ms Suzilawati Abu Samah
Date Deposited: 13 Nov 2013 01:36
Last Modified: 13 Nov 2013 01:36
URII: http://shdl.mmu.edu.my/id/eprint/4394


Downloads per month over past year

View ItemEdit (login required)