Combinatorial pattern discovery in biological sequences: The TEIRESIAS algorithm.
BACKGROUND
The discovery of motifs in biological sequences is an important problem.


RESULTS
This paper presents a new algorithm for the discovery of rigid patterns (motifs) in biological sequences. Our method is combinatorial in nature and able to produce all patterns that appear in at least a (user-defined) minimum number of sequences, yet it manages to be very efficient by avoiding the enumeration of the entire pattern space. Furthermore, the reported patterns are maximal: any reported pattern cannot be made more specific and still keep on appearing at the exact same positions within the input sequences. The effectiveness of the proposed approach is showcased on a number of test cases which aim to: (i) validate the approach through the discovery of previously reported patterns; (ii) demonstrate the capability to identify automatically highly selective patterns particular to the sequences under consideration. Finally, experimental analysis indicates that the algorithm is output sensitive, i.e. its running time is quasi-linear to the size of the generated output.
Rigoutsos
I
I
Computational Biology Center, IBM Thomas J. Watson Research Center, York Town Heights, NY 10598, USA.
Floratos
A
A
D000465:Algorithms; D000595:Amino Acid Sequence; D000818:Animals; D017124:Conserved Sequence; D005069:Evaluation Studies as Topic; D006657:Histones / Q000737:chemistry; D006801:Humans; D007874:Leghemoglobin / Q000737:chemistry; D008969:Molecular Sequence Data; D010363:Pattern Recognition, Automated; D016415:Sequence Alignment / Q000379:methods; D017421:Sequence Analysis
D006657:Histones; D007874:Leghemoglobin