Journals and their citation relations are abstracted into journal citation networks, basing on CSTPC journal database from year 2003 to 2006. The network shows some typical characteristics from complex networks. This paper presents the idea of using motifs, subgraphs with higher occurrence in real network than in random ones, to discover two different citation patterns in journal communities. A...

Searching for repeated features characterizing biological data is fundamental in computational biology. When biological networks are under analysis, the presence of repeated modules across the same network (or several distinct ones) is shown to be very relevant. Indeed, several studies prove that biological networks can be often understood in terms of coalitions of basic repeated building block...

In 1985 the mathematician H. S. M. Coxeter suggested that one could cover a torus in a regular way with 18 copies of the butterfly motif of M. C. Escher's Notebook Drawing Number 70. In this paper, we show how 168 copies of that motif can cover a surface of genus 3 a 3-holed torus. In fact, we cover a polyhedron of genus 3 with such butterflies.

1. Among the many different star-like motifs used in the geometrical art of Islam, there is one which stands out as distinctively "Islamic" (see fig. 1). We shall call this motif a geometric rosette, since it resembles a flower or rosette, with an outer ring formed by a variable number of "petals" encircling a central star. One possible interpretation of the formal, if not historical, origin of...

SUMMARY PDZBase is a database that aims to contain all known PDZ-domain-mediated protein-protein interactions. Currently, PDZBase contains approximately 300 such interactions, which have been manually extracted from > 200 articles. The database can be queried through both sequence motif and keyword-based searches, and the sequences of interacting proteins can be visually inspected through align...

This project investigates a number of algorithms for discovering regulatory motifs in the DNA of magnetic bacteria. The most promising of these is then implemented in Java and evaluated using a combination of synthetic data and previously characterised real-world data. The implemented algorithm is also used to study three previously uncharacterised datasets; a number of new potential motifs are...

Most motif discovery algorithms from DNA sequences require the motif's length as input. Styczynski et al. introduced the Extended (l,d)-Motif Problem (EMP) where the motif's length is not an input parameter. Unfortunately, their algorithm takes an unacceptably long time to run, e.g. over 3 months to discover a length-14 motif. Since the best motif may not be the longest nor have the largest num...

The structure of networks can be characterized by the frequency of different subnetwork patterns found within them. Where these frequencies deviate from what would be expected in random networks they are termed “motifs” of the network. Interestingly it is often found that networks performing similar functions evidence similar motif frequencies. We present results from a motif analysis of networ...

Discovering approximately recurrent motifs (ARMs) in timeseries is an active area of research in data mining. Exact motif discovery was later defined as the problem of efficiently finding the most similar pairs of timeseries subsequences and can be used as a basis for discovering ARMs. The most efficient algorithm for solving this problem is the MK algorithm which was designed to find a single ...

We present an algorithm that can create patterns that are locally fractal in nature, but repeat in two independent directions in the Euclidean plane — in other word “wallpaper patterns”. The goal of the algorithm is to randomly place progressively smaller copies of a basic sub-pattern or motif within a fundamental region for one of the 17 wallpaper groups. This is done in such a way as to compl...