Discovering Motifs in DNA Sequences: A Suffix Tree Based Approach

被引:0
|
作者
Prakash, Sanchi [1 ]
Agarwal, Harshit [1 ]
Agarwal, Urvi [1 ]
Biswas, Prantik [1 ]
Dawn, Suma [1 ]
机构
[1] Jaypee Inst Informat Technol, Noida, India
来源
PROCEEDINGS OF THE 2018 IEEE 8TH INTERNATIONAL ADVANCE COMPUTING CONFERENCE (IACC 2018) | 2018年
关键词
Motif finding problem; Suffix tree; DNA sequences; Trie; Transcription factors;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Motif discovery also known as motif finding is a challenging problem in the field of bioinformatics that deals with various computational and statistical techniques to identify short patterns, often referred to as motifs that corresponds to the binding sites in the DNA sequence for transcription factors. Owing to the recent growth of bioinformatics, a good number of algorithms have come into limelight. This paper proposes a competent algorithm that extracts binding sites in set of DNA sequences for transcription factors, using successive iterations on the sequences provided. The motif we work on are of unknown length, un-gapped and non-mutated. The algorithm uses suffix trie for finding such sites. In this approach the first sequence is used as base for constructing the suffix trie and is mapped with other sequences which results in extraction of the motif. Additionally, this algorithm can also be applied to related problems in the field of data mining, pattern detection, etc.
引用
收藏
页码:327 / 332
页数:6
相关论文
共 50 条
  • [1] Discovering Motifs in DNA Sequences: A Candidate Motifs Based Approach
    Jain, Abhinav
    Parashar, Rajat
    Goyal, Ashish Kumar
    Biswas, Prantik
    Dawn, Suma
    Nanda, Aparajita
    2018 FIFTH INTERNATIONAL CONFERENCE ON PARALLEL, DISTRIBUTED AND GRID COMPUTING (IEEE PDGC), 2018, : 599 - 604
  • [2] Discovering motifs in DNA sequences
    Guan, JW
    Liu, DY
    Bell, DA
    FUNDAMENTA INFORMATICAE, 2004, 59 (2-3) : 119 - 134
  • [3] Suffix tree characterization of maximal motifs in biological sequences
    Federico, Maria
    Pisanti, Nadia
    Communications in Computer and Information Science, 2008, 13 : 456 - 465
  • [4] Suffix tree characterization of maximal motifs in biological sequences
    Federico, Maria
    Pisanti, Nadia
    THEORETICAL COMPUTER SCIENCE, 2009, 410 (43) : 4391 - 4401
  • [5] Suffix tree characterization of maximal motifs in biological sequences
    Federico, Maria
    Pisanti, Nadia
    BIOINFORMATICS RESEARCH AND DEVELOPMENT, PROCEEDINGS, 2008, 13 : 456 - +
  • [6] A suffix tree construction algorithm for DNA sequences
    Huo, Hongwei
    Stojkovic, Vojislav
    PROCEEDINGS OF THE 7TH IEEE INTERNATIONAL SYMPOSIUM ON BIOINFORMATICS AND BIOENGINEERING, VOLS I AND II, 2007, : 1178 - +
  • [7] Discovering motifs in ranked lists of DNA sequences
    Eden, Eran
    Lipson, Doron
    Yogev, Sivan
    Yakhini, Zohar
    PLOS COMPUTATIONAL BIOLOGY, 2007, 3 (03) : 508 - 522
  • [8] EMD: an ensemble algorithm for discovering regulatory motifs in DNA sequences
    Hu, Jianjun
    Yang, Yifeng D.
    Kihara, Daisuke
    BMC BIOINFORMATICS, 2006, 7 (1)
  • [9] EMD: an ensemble algorithm for discovering regulatory motifs in DNA sequences
    Jianjun Hu
    Yifeng D Yang
    Daisuke Kihara
    BMC Bioinformatics, 7
  • [10] DLocalMotif: a discriminative approach for discovering local motifs in protein sequences
    Mehdi, Ahmed M.
    Sehgal, Muhammad Shoaib B.
    Kobe, Bostjan
    Bailey, Timothy L.
    Boden, Mikael
    BIOINFORMATICS, 2013, 29 (01) : 39 - 46