Apart from the search for interactions of single physical entities, the user can search for shortest paths of interactions connecting two distinct physical entities in the overall interaction network stored in the database. If a path between the entities of interest exists, it can be further constrained by forbidding certain intermediates. Interaction paths can be visualized in the visualization environment.
