AP Clustering Algorithm Solving Planted (L, d )Motif Identification
[1]CHEN Kun,ZHANG Xiao-jun.AP Clustering Algorithm Solving Planted (L, d )Motif Identification[J].Journal of Zhengzhou University (Engineering Science),2015,36(03):110-114.[doi:10.3969/j. issn.1671 -6833.2015.03.024]
Copy
Journal of Zhengzhou University (Engineering Science)[ISSN
1671-6833/CN
41-1339/T] Volume:
36卷
Number of periods:
2015 03
Page number:
110-114
Column:
Public date:
2015-06-30
- Title:
- AP Clustering Algorithm Solving Planted (L, d )Motif Identification
- CLC:
- TP39
- DOI:
- 10.3969/j. issn.1671 -6833.2015.03.024
- Abstract:
- Transcription factors can be combined with the special DNA sequence that can control gene tran-scription process.The special DNA sequence is called the motifs.The motif identification is to find a set ofDNA fragments with both similar functions and similar forms. It plays a crucial role in the research on thestructure and function of genes.The problem was converted to the model which can be processed by AP cluste-ring algorithm.Then we get steady candidate motifs by using AP clustering.Finally we use the greedy algo-rithm to refine the clustering results.We can get a group of candidate motifs set,evaluate candidate motifs setby information content and output the optimal motif set.Thereby the new algorithm is designed for the prob-lem. The experimental results on both simulated data and real data demonstrate the validity of the proposed al-gorithm.
- References:
- -
- Similar References:
Memo
-
Last Update: