1 citations · 2 across the 3 of their papers we have counts for
3 papers
Largest Weight Common Subtree Embeddings with Distance Penalties
Andre Droschinsky, Nils M. Kriege, Petra Mutzel
The largest common embeddable subtree problem asks for the largest possible tree embeddable into two input trees and generalizes the classical maximum common subtree problem. Sever…
A note on block-and-bridge preserving maximum common subgraph algorithms for outerplanar graphs
Nils M. Kriege, Andre Droschinsky, Petra Mutzel
Schietgat, Ramon and Bruynooghe proposed a polynomial-time algorithm for computing a maximum common subgraph under the block-and-bridge preserving subgraph isomorphism (BBP-MCS) fo…
Finding Largest Common Substructures of Molecules in Quadratic Time
Andre Droschinsky, Nils Kriege, Petra Mutzel
Finding the common structural features of two molecules is a fundamental task in cheminformatics. Most drugs are small molecules, which can naturally be interpreted as graphs. Henc…