Exact Planted (l, d) Motif Search Algorithms: A Review

The detection of motifs, the meaningful patterns from computational biological data has been studied considerably by virtue of its predominant significance in the biological subjects like gene function, drug design, human disease etc. Many different approaches have been experimented and explored by...

Full description

Saved in:
Bibliographic Details
Published in2018 International Conference on Research in Intelligent and Computing in Engineering (RICE) pp. 1 - 6
Main Authors Mohanty, Satarupa, Mohanty, Suneeta, Roy, Sharmistha
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.08.2018
Subjects
Approximation algorithms
DNA
enumeration of patterns
graph theory
Heuristic algorithms
Machine learning algorithms
motif search
Prediction algorithms
Search problems
search tree
suffix tree
Online AccessGet full text
DOI10.1109/RICE.2018.8509078

Cover

More Information
Summary:The detection of motifs, the meaningful patterns from computational biological data has been studied considerably by virtue of its predominant significance in the biological subjects like gene function, drug design, human disease etc. Many different approaches have been experimented and explored by the researchers towards the development of motif discovery algorithms and tools and the progress achieved is very encouraging. This paper is an attempt towards exploring the effectiveness of exact approach from the domain of planted ( l, d) motif search.
DOI:10.1109/RICE.2018.8509078