Pattern Discovery Methods for Protein Topology Diagrams

database. The good property of this approach is that algorithm complexity grows proportionally to the size of the set of examples in learning set. We are now working on improved versions on pattern matching and pattern learning algorithms and expect that we will be able to obtain practically efficient pattern discovery method that will guarantee the finding of maximal pattern(s). We have been experimenting with learning patterns for fi and fffi domains at the H level in the CATH hierarchy. We are evaluating our results by determining how many false positives are returned by a search over the database using the discovered pattern; initial results are encouraging in many cases. Clique detection works by finding of common patterns via maximal clique detection in edge product graphs, using for example the Bron-Kerbosch algorithm [2]. We have implemented a modified version for this approach that takes advantage of the ordering of graphs an