Matches in SemOpenAlex for { <https://semopenalex.org/work/W162400407> ?p ?o ?g. }
Showing items 1 to 46 of
46
with 100 items per page.
- W162400407 abstract "In this work, we compare CLP and SAT solvers on the NP-complete problem of deciding the existence of a subgraph epimorphism between two graphs. Our interest in this variant of graph matching problem stems from the study of model reductions in systems biology, where large systems of biochemical reactions can be naturally represented by bipartite digraphs of species and reactions. In this setting, model reduction can be formalized as the existence of a sequence of vertex, species or reaction, deletion and merge operations which transforms a first reaction graph into a second graph. This problem is in turn equivalent to the existence of a subgraph (corresponding to delete operations) epimorphism (i.e. surjective homomorphism, corresponding to merge operations) from the first graph to the second. We show how subgraph epimorphism problems can be modeled as Boolean constraint satisfaction problems, and we compare CLP and SAT solvers on a large benchmark of reaction graphs from systems biology." @default.
- W162400407 created "2016-06-24" @default.
- W162400407 creator A5000983836 @default.
- W162400407 creator A5003525513 @default.
- W162400407 creator A5032434310 @default.
- W162400407 creator A5058495604 @default.
- W162400407 date "2013-09-16" @default.
- W162400407 modified "2023-09-25" @default.
- W162400407 title "Solving Subgraph Epimorphism Problems using CLP and SAT" @default.
- W162400407 cites W2395737562 @default.
- W162400407 hasPublicationYear "2013" @default.
- W162400407 type Work @default.
- W162400407 sameAs 162400407 @default.
- W162400407 citedByCount "1" @default.
- W162400407 countsByYear W1624004072018 @default.
- W162400407 crossrefType "proceedings-article" @default.
- W162400407 hasAuthorship W162400407A5000983836 @default.
- W162400407 hasAuthorship W162400407A5003525513 @default.
- W162400407 hasAuthorship W162400407A5032434310 @default.
- W162400407 hasAuthorship W162400407A5058495604 @default.
- W162400407 hasBestOaLocation W1624004071 @default.
- W162400407 hasConcept C114614502 @default.
- W162400407 hasConcept C16310669 @default.
- W162400407 hasConcept C33923547 @default.
- W162400407 hasConcept C41008148 @default.
- W162400407 hasConceptScore W162400407C114614502 @default.
- W162400407 hasConceptScore W162400407C16310669 @default.
- W162400407 hasConceptScore W162400407C33923547 @default.
- W162400407 hasConceptScore W162400407C41008148 @default.
- W162400407 hasLocation W1624004071 @default.
- W162400407 hasOpenAccess W162400407 @default.
- W162400407 hasPrimaryLocation W1624004071 @default.
- W162400407 hasRelatedWork W1978899268 @default.
- W162400407 hasRelatedWork W1991102889 @default.
- W162400407 hasRelatedWork W2025897059 @default.
- W162400407 hasRelatedWork W2062197095 @default.
- W162400407 hasRelatedWork W2748952813 @default.
- W162400407 hasRelatedWork W2899084033 @default.
- W162400407 hasRelatedWork W2949079789 @default.
- W162400407 hasRelatedWork W3100909012 @default.
- W162400407 hasRelatedWork W3170275789 @default.
- W162400407 hasRelatedWork W4287780410 @default.
- W162400407 isParatext "false" @default.
- W162400407 isRetracted "false" @default.
- W162400407 magId "162400407" @default.
- W162400407 workType "article" @default.