RecMotif: a novel fast algorithm for weak motif discovery
2010

RecMotif: A Fast Algorithm for Discovering Weak DNA Motifs

publication Evidence: high

Author Information

Author(s): Sun He Quan, Low Malcolm Yoke Hean, Hsu Wen Jing, Rajapakse Jagath C

Primary Institution: Nanyang Technological University

Hypothesis

Can a new algorithm, RecMotif, efficiently discover weak motifs in DNA sequences?

Conclusion

RecMotif is a novel algorithm that efficiently discovers weak motifs in DNA sequences with low memory usage.

Supporting Evidence

  • RecMotif can discover motifs with specific (l, d) settings efficiently.
  • It outperforms other algorithms in terms of execution time for longer sequences.
  • RecMotif requires only a space complexity of O(nm2).
  • It successfully discovered known motifs in biological data sets.

Takeaway

RecMotif is a computer program that helps find patterns in DNA quickly and without using too much memory.

Methodology

The algorithm uses a recursive approach to construct cliques of motif instances from sample substrings.

Limitations

RecMotif struggles with shorter and weaker motifs, requiring improvements for such cases.

Digital Object Identifier (DOI)

10.1186/1471-2105-11-S11-S8

Want to read the original?

Access the complete publication on the publisher's website

View Original Publication