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, DEC 04-07, 2009 , Malacca, MALAYSIA.

Full text not available from this repository.
Official URL: http://dx.doi.org/10.1109/SoCPaR.2009.18

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.

Item Type: Conference or Workshop Item (Paper)
Subjects: T Technology > T Technology (General)
Q Science > QA Mathematics > QA75.5-76.95 Electronic computers. Computer science
Divisions: Faculty of Engineering and Technology (FET)
Depositing User: Ms Suzilawati Abu Samah
Date Deposited: 23 Sep 2011 03:21
Last Modified: 23 Sep 2011 03:21
URI: http://shdl.mmu.edu.my/id/eprint/1930

Actions (login required)

View Item View Item