Subgraph matching algorithms are used to find and enumerate specific interconnection structures in networks. By enumerating these specific structures/subgraphs, the fundamental properties of the network can be derived. More specifically in biological networks, subgraph matching algorithms are used to discover network motifs, specific patterns occurring more often than expected by chance. Finding these network motifs yields information on the underlying biological relations modelled by the network. In this work, we present the Index-based Subgraph Matching Algorithm with General Symmetries (ISMAGS), an improved version of the Index-based Subgraph Matching Algorithm (ISMA). ISMA quickly finds all instances of a predefined motif in a network by intelligently exploring the search space and taking into account easily identifiable symmetric structures. However, more complex symmetries (possibly involving switching multiple nodes) are not taken into account, resulting in superfluous output. ISMAGS overcomes this problem by using a customised symmetry analysis phase to detect all symmetric structures in the network motif subgraphs. These structures are then converted to symmetry-breaking constraints used to prune the search space and speed up calculations. The performance of the algorithm was tested on several types of networks (biological, social and computer networks) for various subgraphs with a varying degree of symmetry. For subgraphs with complex (multi-node) symmetric structures, high speed-up factors are obtained as the search space is pruned by the symmetry-breaking constraints. For subgraphs with no or simple symmetric structures, ISMAGS still reduces computation times by optimising set operations. Moreover, the calculated list of subgraph instances is minimal as it contains no instances that differ by only a subgraph symmetry. An implementation of the algorithm is freely available at https://github.com/mhoubraken/ISMAGS.

Supplementary data are available at Bioinformatics online.

Traditional traffic monitoring systems are mostly based on road side equipment measuring traffic conditions throughout the day. With more and more GPS enabled connected devices, Floating Car Data (FCD) has become an interesting source of traffic information, requiring only a fraction of the road side equipment infrastructure investment. While FCD is commonly used to derive historic travel times on individual roads and to evaluate other traffic data and algorithms, it could also be used in traffic management systems directly. However, as live systems only capture a small percentage of all traffic, its use in live operating systems needs to be examined. In this paper, we investigate the potential of FCD to be used as input data for live automated traffic management systems. The FCD in this study is collected by a live country-wide FCD system in the Netherlands covering 6-8% of all vehicles. The (anonymised) data is first compared to available road side measurements to show the current quality of FCD. It is then used in a dynamic speed management system and compared to the installed system on the studied highway. Results indicate the FCD setup can approximate the installed system, showing the feasibility of a live system.