@prefix dcterms: <
http://purl.org/dc/terms/
> .
@prefix foaf: <
http://xmlns.com/foaf/0.1/
> .
@prefix hycl: <
http://purl.org/petapico/o/hycl#
> .
@prefix np: <
http://www.nanopub.org/nschema#
> .
@prefix npx: <
http://purl.org/nanopub/x/
> .
@prefix ns1: <
http://purl.org/spar/cito/
> .
@prefix ns2: <
http://schema.org/
> .
@prefix nt: <
https://w3id.org/np/o/ntemplate/
> .
@prefix orcid: <
https://orcid.org/
> .
@prefix prov: <
http://www.w3.org/ns/prov#
> .
@prefix rdfs: <
http://www.w3.org/2000/01/rdf-schema#
> .
@prefix sub: <
https://w3id.org/np/RAbe1ffda58109e091214d4be1059cc4c20c18495d5ef/
> .
@prefix xsd: <
http://www.w3.org/2001/XMLSchema#
> .
sub:Head
{
<
https://w3id.org/np/RAs1fOQDhSTB_fNKKpVl2hYq7VS6n7gD29_D_5cNQsyok
>
np:hasAssertion
sub:assertion
;
np:hasProvenance
sub:provenance
;
np:hasPublicationInfo
sub:pubinfo
;
a
np:Nanopublication
.
}
sub:assertion
{
<
http://purl.org/aida/Quantum%20approximate%20optimization%20algorithms%20outperform%20classical%20methods%20for%20disjoint%20network%20motif%20identification%20in%20biological%20networks.
>
ns1:obtainsSupportFrom
<
https://doi.org/10.1093/bioadv/vbae208
> ;
ns2:about
<
http://www.wikidata.org/entity/Q17137535
> , <
http://www.wikidata.org/entity/Q47536
> ;
a
hycl:AIDA-Sentence
.
}
sub:provenance
{
sub:assertion
prov:wasAttributedTo
orcid:0000-0002-1784-2920
.
}
sub:pubinfo
{
<
http://www.wikidata.org/entity/Q17137535
>
nt:hasLabelFromApi
"network motif" .
<
http://www.wikidata.org/entity/Q47536
>
nt:hasLabelFromApi
"quantum computing" .
orcid:0000-0002-1784-2920
foaf:name
"Anne Fouilloux" .
<
https://w3id.org/np/RAs1fOQDhSTB_fNKKpVl2hYq7VS6n7gD29_D_5cNQsyok
>
dcterms:created
"2026-01-05T15:51:40.259Z"^^
xsd:dateTime
;
dcterms:creator
orcid:0000-0002-1784-2920
;
dcterms:license
<
https://creativecommons.org/licenses/by/4.0/
> ;
npx:hasNanopubType
hycl:AIDA-Sentence
, <
http://purl.org/petapico/o/hycl
> ;
npx:introduces
<
http://purl.org/aida/Quantum%20approximate%20optimization%20algorithms%20outperform%20classical%20methods%20for%20disjoint%20network%20motif%20identification%20in%20biological%20networks.
> ;
npx:wasCreatedAt
<
https://nanodash.knowledgepixels.com/
> ;
rdfs:label
"AIDA sentence: Quantum approximate optimization algorithms outperform classical methods for disjoint network motif ..." ;
nt:wasCreatedFromProvenanceTemplate
<
https://w3id.org/np/RA7lSq6MuK_TIC6JMSHvLtee3lpLoZDOqLJCLXevnrPoU
> ;
nt:wasCreatedFromPubinfoTemplate
<
https://w3id.org/np/RA0J4vUn_dekg-U1kK3AOEt02p9mT2WO03uGxLDec1jLw
> , <
https://w3id.org/np/RAukAcWHRDlkqxk7H2XNSegc1WnHI569INvNr-xdptDGI
> ;
nt:wasCreatedFromTemplate
<
https://w3id.org/np/RALmXhDw3rHcMveTgbv8VtWxijUHwnSqhCmtJFIPKWVaA
> .
<
https://w3id.org/np/RAs1fOQDhSTB_fNKKpVl2hYq7VS6n7gD29_D_5cNQsyok/sig
>
npx:hasAlgorithm
"RSA" ;
npx:hasPublicKey
"MIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKCAQEAosxbitQQzLXi1949Zd9JmSkGfYHHlj/CZZ7iiYs1TrZ5/Jk/wGA7kHEv7f9NtsinOdBo9EtHj/jgHE5W2Vv404JbOAY280PvH5Jns5ObWdVZmtHeCw0ZIdPEqNrurrEweKhzcTJW/YRpYWPwVPo47XyIW6IAcmx6gfdtmdPddMpplqExrP6G99ksXfXlZI0InQtZJRSGK5lYLLNzaofFtupPI5OAAGjooDyHijp0Ap2HIXH6WpO4S44cFPKU34pH2xhIY4/XT5DG1X5UoiVHs2Yoo30BHFudj/kAFwdzcy6Yh4tMDaB3ox6p7pi267d7n0y7kypC0Nt+hfgHQ1FpgwIDAQAB" ;
npx:hasSignature
"LGLIlX5fe8q/C8LDlRI9QZKkA8OnYG8gAJb3RqJFxrzoTaHwIE3qxKZ+6Cavs/4oqszNXiTE/OFMu2bJTroPdUdPY2FACozjyMO2S1Jm/GC4vP1kzNOsOTjGZTqzaJdcyh3L4FTjkdvQgq7SaWabygRVGhPFTi4khONzBAWpTqhRRrxFKeYIckYiHoZWer9AzwBSoPVXosU7lxoOYDRYA9UVNKKmna8x+yfK9/TQgl3M6J9gQrRusw+4+L2HAdoWcI91hpqiCuFY6ThtVg+9uBjUpKvCX4k2VbfE4z1wwZsrNC7zYHoRQyTyG0I2Q7Jx17G0/zcepVSNVftGSZLYaA==" ;
npx:hasSignatureTarget
<
https://w3id.org/np/RAs1fOQDhSTB_fNKKpVl2hYq7VS6n7gD29_D_5cNQsyok
> ;
npx:signedBy
orcid:0000-0002-1784-2920
.
}