Tree-structured algorithm for long weak motif discovery | Zendy

He Sun | Zendy; Malcolm Yoke Hean Low | Zendy; Wen Jing Hsu | Zendy; Ching Wai Tan | Zendy; Jagath C. Rajapakse | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Tree-structured algorithm for long weak motif discovery

Author(s) -

He Sun,

Malcolm Yoke Hean Low,

Wen Jing Hsu,

Ching Wai Tan,

Jagath C. Rajapakse

Publication year - 2011

Publication title -

bioinformatics

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 3.599

H-Index - 390

eISSN - 1367-4811

pISSN - 1367-4803

DOI - 10.1093/bioinformatics/btr459

Subject(s) - motif (music) , computer science , scalability , algorithm , probabilistic logic , tree (set theory) , structural motif , theoretical computer science , data mining , sequence motif , artificial intelligence , mathematics , combinatorics , biology , dna , database , acoustics , biochemistry , physics , genetics

Motifs in DNA sequences often appear in degenerate form, so there has been an increased interest in computational algorithms for weak motif discovery. Probabilistic algorithms are unable to detect weak motifs while exact methods have been able to detect only short weak motifs. This article proposes an exact tree-based motif detection (TreeMotif) algorithm capable of discovering longer and weaker motifs than by the existing methods.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research