Case Studies In Pattern Discovery Without Alignment Results Using The Teiresias Algorithm

        Pattern discovery (an NP-hard problem), in contrast to pattern matching (a
        problem solvable in polynomial time), is a challenging problem. Using
        Teiresias, a newly developed algorithm, we are exploring a number of test cases
        in order to identify patterns of amino acids that appear across sequences
        (common motifs) as well as within individual sequences (internal repeats). The
        examples aim at: (a) the validation of the approach through the discovery of
        previously reported patterns; (b) the demonstration of the capability to
        automatically identify highly selective patterns particular to the sequences
        under consideration; and, (c) the discovery of previously unidentified
        patterns in these well-studied example cases.

By: Isidore Rigoutsos, Aris Floratos, Christos Ouzounis (EMBL Cambridge)

Published in: RC20803 in 1997


This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.

Questions about this service can be mailed to .