https://w3id.org/np/RANm9cS8je8mOTOqvtPvKZ_fZyBSXCDKeqQZvA1EwXZWo/Head https://w3id.org/np/RANm9cS8je8mOTOqvtPvKZ_fZyBSXCDKeqQZvA1EwXZWo http://www.nanopub.org/nschema#hasAssertion https://w3id.org/np/RANm9cS8je8mOTOqvtPvKZ_fZyBSXCDKeqQZvA1EwXZWo/assertion https://w3id.org/np/RANm9cS8je8mOTOqvtPvKZ_fZyBSXCDKeqQZvA1EwXZWo http://www.nanopub.org/nschema#hasProvenance https://w3id.org/np/RANm9cS8je8mOTOqvtPvKZ_fZyBSXCDKeqQZvA1EwXZWo/provenance https://w3id.org/np/RANm9cS8je8mOTOqvtPvKZ_fZyBSXCDKeqQZvA1EwXZWo http://www.nanopub.org/nschema#hasPublicationInfo https://w3id.org/np/RANm9cS8je8mOTOqvtPvKZ_fZyBSXCDKeqQZvA1EwXZWo/pubinfo https://w3id.org/np/RANm9cS8je8mOTOqvtPvKZ_fZyBSXCDKeqQZvA1EwXZWo http://www.w3.org/1999/02/22-rdf-syntax-ns#type http://www.nanopub.org/nschema#Nanopublication https://w3id.org/np/RANm9cS8je8mOTOqvtPvKZ_fZyBSXCDKeqQZvA1EwXZWo/assertion http://purl.org/aida/Quantum%20approximate%20optimization%20algorithms%20outperform%20classical%20methods%20for%20disjoint%20network%20motif%20identification%20in%20biological%20networks. http://purl.org/dc/terms/source https://doi.org/10.5281/zenodo.18157621 http://purl.org/aida/Quantum%20approximate%20optimization%20algorithms%20outperform%20classical%20methods%20for%20disjoint%20network%20motif%20identification%20in%20biological%20networks. http://www.w3.org/1999/02/22-rdf-syntax-ns#type https://w3id.org/sciencelive/o/terms/FORRT-Claim http://purl.org/aida/Quantum%20approximate%20optimization%20algorithms%20outperform%20classical%20methods%20for%20disjoint%20network%20motif%20identification%20in%20biological%20networks. http://www.w3.org/1999/02/22-rdf-syntax-ns#type https://w3id.org/sciencelive/o/terms/computational_performance-FORRT-Claim https://w3id.org/np/RANm9cS8je8mOTOqvtPvKZ_fZyBSXCDKeqQZvA1EwXZWo/provenance https://w3id.org/np/RANm9cS8je8mOTOqvtPvKZ_fZyBSXCDKeqQZvA1EwXZWo/assertion http://www.w3.org/ns/prov#wasAttributedTo https://orcid.org/0000-0002-1784-2920 https://w3id.org/np/RANm9cS8je8mOTOqvtPvKZ_fZyBSXCDKeqQZvA1EwXZWo/pubinfo http://purl.org/aida/Quantum%20approximate%20optimization%20algorithms%20outperform%20classical%20methods%20for%20disjoint%20network%20motif%20identification%20in%20biological%20networks. https://w3id.org/np/o/ntemplate/hasLabelFromApi AIDA sentence: Quantum approximate optimization algorithms outperform classical methods for disjoint network motif ... https://orcid.org/0000-0002-1784-2920 http://xmlns.com/foaf/0.1/name Anne Fouilloux https://w3id.org/np/RANm9cS8je8mOTOqvtPvKZ_fZyBSXCDKeqQZvA1EwXZWo http://purl.org/dc/terms/created 2026-02-18T21:24:58.546Z https://w3id.org/np/RANm9cS8je8mOTOqvtPvKZ_fZyBSXCDKeqQZvA1EwXZWo http://purl.org/dc/terms/creator https://orcid.org/0000-0002-1784-2920 https://w3id.org/np/RANm9cS8je8mOTOqvtPvKZ_fZyBSXCDKeqQZvA1EwXZWo http://purl.org/dc/terms/license https://creativecommons.org/licenses/by/4.0/ https://w3id.org/np/RANm9cS8je8mOTOqvtPvKZ_fZyBSXCDKeqQZvA1EwXZWo http://purl.org/nanopub/x/introduces http://purl.org/aida/Quantum%20approximate%20optimization%20algorithms%20outperform%20classical%20methods%20for%20disjoint%20network%20motif%20identification%20in%20biological%20networks. https://w3id.org/np/RANm9cS8je8mOTOqvtPvKZ_fZyBSXCDKeqQZvA1EwXZWo http://purl.org/nanopub/x/supersedes https://w3id.org/np/RAc4EIl-I7T5ny_-6Zx1p--X0bocq39nZJBAHFc_01SDg https://w3id.org/np/RANm9cS8je8mOTOqvtPvKZ_fZyBSXCDKeqQZvA1EwXZWo http://purl.org/nanopub/x/wasCreatedAt https://nanodash.knowledgepixels.com/ https://w3id.org/np/RANm9cS8je8mOTOqvtPvKZ_fZyBSXCDKeqQZvA1EwXZWo https://w3id.org/np/o/ntemplate/wasCreatedFromProvenanceTemplate https://w3id.org/np/RA7lSq6MuK_TIC6JMSHvLtee3lpLoZDOqLJCLXevnrPoU https://w3id.org/np/RANm9cS8je8mOTOqvtPvKZ_fZyBSXCDKeqQZvA1EwXZWo https://w3id.org/np/o/ntemplate/wasCreatedFromPubinfoTemplate https://w3id.org/np/RA0J4vUn_dekg-U1kK3AOEt02p9mT2WO03uGxLDec1jLw https://w3id.org/np/RANm9cS8je8mOTOqvtPvKZ_fZyBSXCDKeqQZvA1EwXZWo https://w3id.org/np/o/ntemplate/wasCreatedFromPubinfoTemplate https://w3id.org/np/RAoTD7udB2KtUuOuAe74tJi1t3VzK0DyWS7rYVAq1GRvw https://w3id.org/np/RANm9cS8je8mOTOqvtPvKZ_fZyBSXCDKeqQZvA1EwXZWo https://w3id.org/np/o/ntemplate/wasCreatedFromPubinfoTemplate https://w3id.org/np/RAukAcWHRDlkqxk7H2XNSegc1WnHI569INvNr-xdptDGI https://w3id.org/np/RANm9cS8je8mOTOqvtPvKZ_fZyBSXCDKeqQZvA1EwXZWo https://w3id.org/np/o/ntemplate/wasCreatedFromTemplate https://w3id.org/np/RAmw2sp_oDePsdYg-7C8GCTMSzqAG2LFDe6NdRK0FwnQE https://w3id.org/np/RANm9cS8je8mOTOqvtPvKZ_fZyBSXCDKeqQZvA1EwXZWo/sig http://purl.org/nanopub/x/hasAlgorithm RSA https://w3id.org/np/RANm9cS8je8mOTOqvtPvKZ_fZyBSXCDKeqQZvA1EwXZWo/sig http://purl.org/nanopub/x/hasPublicKey MIGfMA0GCSqGSIb3DQEBAQUAA4GNADCBiQKBgQDWv2pJnmDsBOq8OlT1aSvYXSuWT34WOp4FYqEzdnn2F0kqzcFevBqWGZDxJWC0lqCrDEuNfp2QFyPe/+nES9dlHGYIhqPi68fwK6ZiNUotRFxXou+rjFznVvUxtCL8Ede79EBHwWN61QtwSIcU12bLoZsNPFlqQASQ93BJuKlihwIDAQAB https://w3id.org/np/RANm9cS8je8mOTOqvtPvKZ_fZyBSXCDKeqQZvA1EwXZWo/sig http://purl.org/nanopub/x/hasSignature TxIKJGWU2uyXoAwptf6KPgEWgVw6vRDQ10eckGSV2Zxgu9KEVKaNfl+wELZHH2prNfttm/8GaBBrSJpUr5XsdiBq4gbW8WuiUguddt4muNiTBnAS92qZCceruZ3L/nBmN8m3L2boMNBhgPgDQooW5/BuM5w8locI7ZzEs9H/Dq0= https://w3id.org/np/RANm9cS8je8mOTOqvtPvKZ_fZyBSXCDKeqQZvA1EwXZWo/sig http://purl.org/nanopub/x/hasSignatureTarget https://w3id.org/np/RANm9cS8je8mOTOqvtPvKZ_fZyBSXCDKeqQZvA1EwXZWo https://w3id.org/np/RANm9cS8je8mOTOqvtPvKZ_fZyBSXCDKeqQZvA1EwXZWo/sig http://purl.org/nanopub/x/signedBy https://orcid.org/0000-0002-1784-2920