Lower and Upper Bounds for String Matching in Labelled Graphs String Matching in Labelled Graphs (SMLG) is a generalisation of the classic problem of finding a match for a string into a text. In SMLG, ...