• DocumentCode
    2902833
  • Title

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

  • Author

    Ng, Keng-Hoong ; Phon-Amnuaisuk, Somnuk ; Ho, Chin-Kuan

  • Author_Institution
    Fac. of Inf. Technol., Multimedia Univ., Cyberjaya, Malaysia
  • fYear
    2009
  • fDate
    4-7 Dec. 2009
  • Firstpage
    25
  • Lastpage
    30
  • 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.
  • Keywords
    DNA; biology computing; pattern clustering; EST clustering algorithms; alignment-free clustering algorithms; cDNA libraries; distance measures; expressed sequence tag; gene discovery; transciptome analysis; Assembly; Cloning; Clustering algorithms; DNA; Databases; Information technology; Multimedia computing; Pollution measurement; Sequences; Taxonomy; alignment-free EST clustering; expressed sequence tag; sequence comparison; word frequencies;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Soft Computing and Pattern Recognition, 2009. SOCPAR '09. International Conference of
  • Conference_Location
    Malacca
  • Print_ISBN
    978-1-4244-5330-6
  • Electronic_ISBN
    978-0-7695-3879-2
  • Type

    conf

  • DOI
    10.1109/SoCPaR.2009.18
  • Filename
    5368607