Figure 4.

LGL syntax examples. This figure shows some examples of graph structures defined through the Leaf Graph Language (LGL). Tree structures of any depth and degree can be encoded using the fork arrow (<) and void node (.) mechanisms. Note that through LGL it is possible to define graphs that are not DAGs (see main text), though they are not allowed by Pyleaf.

Napolitano et al. BMC Bioinformatics 2013 14:201   doi:10.1186/1471-2105-14-201
Download authors' original image