Skip to main content
Fig. 1 | Algorithms for Molecular Biology

Fig. 1

From: Heuristic algorithms for best match graph editing

Fig. 1

Construction of the LRT for a BMG \((\vec {G},\sigma )\) using the BUILD algorithm. Each recursion step (pink boxes) corresponds to a vertex of the resulting tree (trivial steps on single vertices are omitted in the drawing). The algorithm recurses on the connected components (gray dashed boxes) of the Aho graphs and the corresponding subsets of triples

Back to article page

Algorithms for Molecular Biology

ISSN: 1748-7188