Mining frequent stem patterns from unaligned RNA sequences

Michiaki Hamada*, Koji Tsuda, Taku Kudo, Taishin Kin, Kiyoshi Asai

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

37 Citations (Scopus)


Motivation: In detection of non-coding RNAs, it is often necessary to identify the secondary structure motifs from a set of putative RNA sequences. Most of the existing algorithms aim to provide the best motif or few good motifs, but biologists often need to inspect all the possible motifs thoroughly. Results: Our method RNAmine employs a graph theoretic representation of RNA sequences and detects all the possible motifs exhaustively using a graph mining algorithm. The motif detection problem boils down to finding frequently appearing patterns in a set of directed and labeled graphs. In the tasks of common secondary structure prediction and local motif detection from long sequences, our method performed favorably both in accuracy and in efficiency with the state-of-the-art methods such as CMFinder.

Original languageEnglish
Pages (from-to)2480-2487
Number of pages8
Issue number20
Publication statusPublished - 2006 Oct
Externally publishedYes

ASJC Scopus subject areas

  • Statistics and Probability
  • Biochemistry
  • Molecular Biology
  • Computer Science Applications
  • Computational Theory and Mathematics
  • Computational Mathematics


Dive into the research topics of 'Mining frequent stem patterns from unaligned RNA sequences'. Together they form a unique fingerprint.

Cite this