We design and analyse efficient algorithms to appximate the frequencies of coloured subgraphs in large graphs. This has important applications for the detection of irregular patterns in complex text networks.