Results 171 to 180 of about 102,063 (249)

The subgraph isomorphism problem

open access: yes, 2013
This thesis describes the problem of finding subgraph isomorphism. This is one of the most basic operations performed on graphs and is an NP-hard problem. We describe in detail the Ullmann algorithm and VF2 algorithm, the most commonly used and state-of-the art algorithms in this field, and a new algorithm called Subsea.
openaire   +1 more source

Orthology and near-cographs in the context of phylogenetic networks. [PDF]

open access: yesAlgorithms Mol Biol
Lindeberg A   +3 more
europepmc   +1 more source

Spatial morphoproteomic features predict disease states from tissue architectures. [PDF]

open access: yesiScience
Hu T   +9 more
europepmc   +1 more source

Solving subgraph isomorphism problems with constraint programming

open access: green, 2009
Stéphane Zampelli   +2 more
openalex   +2 more sources

mineMS2: annotation of spectral libraries with exact fragmentation patterns. [PDF]

open access: yesJ Cheminform
Delabrière A   +10 more
europepmc   +1 more source

Home - About - Disclaimer - Privacy