Efficient motif search in ranked lists and applications to variable gap motifs

Area of Science:

• Bioinformatics
• Computational Biology
• Molecular Biology

Background:

• Sequence elements in DNA, RNA, and proteins are crucial for molecular recognition, regulation, and signaling.
• Current motif searching tools have limitations in coverage and handling large or complex motif spaces.

Purpose of the Study:

• To develop and present advanced statistical and algorithmic approaches for identifying significant sequence motifs.
• To overcome the limitations of existing tools in searching large and variable motif spaces.

Main Methods:

• Utilizing suffix trees for efficient searching of sequence motifs.
• Developing statistical and algorithmic methods to process ranked lists of sequences and identify significant motifs.
• Enabling searches for variable gap motifs and long motifs over large alphabets.

Main Results:

• The developed approach efficiently searches motif spaces not covered by existing tools.
• Analysis of high-throughput data revealed novel motifs and refinements of known motifs.
• Refinement of the human estrogen receptor 1 motif and identification of a variable length motif related to tyrosine phosphorylation.

Conclusions:

• The new computational approach significantly enhances the ability to discover and analyze sequence motifs.
• This advancement has implications for understanding molecular recognition, regulation, and signaling pathways.
• The method provides valuable insights into biological sequence analysis and motif discovery.