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