<https://w3id.org/np/RA7pcsWf52tAa1yYMcmlyeT2vsMDS7IZJYK22r3e_0j98> <http://www.nanopub.org/nschema#hasAssertion> <https://w3id.org/np/RAtobepublished/assertion> <https://w3id.org/np/RAtobepublished/Head> .
<https://w3id.org/np/RA7pcsWf52tAa1yYMcmlyeT2vsMDS7IZJYK22r3e_0j98> <http://www.nanopub.org/nschema#hasProvenance> <https://w3id.org/np/RAtobepublished/provenance> <https://w3id.org/np/RAtobepublished/Head> .
<https://w3id.org/np/RA7pcsWf52tAa1yYMcmlyeT2vsMDS7IZJYK22r3e_0j98> <http://www.nanopub.org/nschema#hasPublicationInfo> <https://w3id.org/np/RAtobepublished/pubinfo> <https://w3id.org/np/RAtobepublished/Head> .
<https://w3id.org/np/RA7pcsWf52tAa1yYMcmlyeT2vsMDS7IZJYK22r3e_0j98> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://www.nanopub.org/nschema#Nanopublication> <https://w3id.org/np/RAtobepublished/Head> .
<http://purl.org/aida/Quantum%20approximate%20optimization%20algorithms%20outperform%20classical%20methods%20for%20disjoint%20network%20motif%20identification%20in%20biological%20networks.> <http://purl.org/dc/terms/isPartOf> <https://w3id.org/np/RAvk9pmoZ2IberoDe7zUWV0bVithiy6CnbSG5y06YuKM0/quantum-computing-applications-for-biodiversity-re> <https://w3id.org/np/RAtobepublished/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> <https://w3id.org/np/RAtobepublished/assertion> .
<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/RAtobepublished/assertion> .
<http://purl.org/aida/Quantum%20approximate%20optimization%20algorithms%20outperform%20classical%20methods%20for%20disjoint%20network%20motif%20identification%20in%20biological%20networks.> <https://schema.org/about> <http://www.wikidata.org/entity/Q17995793> <https://w3id.org/np/RAtobepublished/assertion> .
<http://purl.org/aida/Quantum%20approximate%20optimization%20algorithms%20outperform%20classical%20methods%20for%20disjoint%20network%20motif%20identification%20in%20biological%20networks.> <https://schema.org/about> <http://www.wikidata.org/entity/Q7001080> <https://w3id.org/np/RAtobepublished/assertion> .
<https://w3id.org/np/RAtobepublished/assertion> <http://www.w3.org/ns/prov#wasAttributedTo> <https://orcid.org/0000-0002-1784-2920> <https://w3id.org/np/RAtobepublished/provenance> .
<http://www.wikidata.org/entity/Q17995793> <https://w3id.org/np/o/ntemplate/hasLabelFromApi> "quantum computing" <https://w3id.org/np/RAtobepublished/pubinfo> .
<http://www.wikidata.org/entity/Q7001080> <https://w3id.org/np/o/ntemplate/hasLabelFromApi> "network motif" <https://w3id.org/np/RAtobepublished/pubinfo> .
<https://orcid.org/0000-0002-1784-2920> <http://xmlns.com/foaf/0.1/name> "Anne Fouilloux" <https://w3id.org/np/RAtobepublished/pubinfo> .
<https://w3id.org/np/RA7pcsWf52tAa1yYMcmlyeT2vsMDS7IZJYK22r3e_0j98> <http://purl.org/dc/terms/created> "2026-01-06T18:45:00.000Z"^^<http://www.w3.org/2001/XMLSchema#dateTime> <https://w3id.org/np/RAtobepublished/pubinfo> .
<https://w3id.org/np/RA7pcsWf52tAa1yYMcmlyeT2vsMDS7IZJYK22r3e_0j98> <http://purl.org/dc/terms/creator> <https://orcid.org/0000-0002-1784-2920> <https://w3id.org/np/RAtobepublished/pubinfo> .
<https://w3id.org/np/RA7pcsWf52tAa1yYMcmlyeT2vsMDS7IZJYK22r3e_0j98> <http://purl.org/dc/terms/license> <https://creativecommons.org/licenses/by/4.0/> <https://w3id.org/np/RAtobepublished/pubinfo> .
<https://w3id.org/np/RA7pcsWf52tAa1yYMcmlyeT2vsMDS7IZJYK22r3e_0j98> <http://purl.org/nanopub/x/hasNanopubType> <http://purl.org/petapico/o/hycl#AIDA-Sentence> <https://w3id.org/np/RAtobepublished/pubinfo> .
<https://w3id.org/np/RA7pcsWf52tAa1yYMcmlyeT2vsMDS7IZJYK22r3e_0j98> <http://purl.org/nanopub/x/hasNanopubType> <http://purl.org/petapico/o/hycl> <https://w3id.org/np/RAtobepublished/pubinfo> .
<https://w3id.org/np/RA7pcsWf52tAa1yYMcmlyeT2vsMDS7IZJYK22r3e_0j98> <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/RAtobepublished/pubinfo> .
<https://w3id.org/np/RA7pcsWf52tAa1yYMcmlyeT2vsMDS7IZJYK22r3e_0j98> <http://purl.org/nanopub/x/supersedes> <https://w3id.org/np/RABeAjc9eu5DTkY8a9igMf2Tb4x3Vnk_tBl2otoymNYvo> <https://w3id.org/np/RAtobepublished/pubinfo> .
<https://w3id.org/np/RA7pcsWf52tAa1yYMcmlyeT2vsMDS7IZJYK22r3e_0j98> <http://purl.org/nanopub/x/wasCreatedAt> <https://nanodash.knowledgepixels.com/> <https://w3id.org/np/RAtobepublished/pubinfo> .
<https://w3id.org/np/RA7pcsWf52tAa1yYMcmlyeT2vsMDS7IZJYK22r3e_0j98> <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/RAtobepublished/pubinfo> .
<https://w3id.org/np/RA7pcsWf52tAa1yYMcmlyeT2vsMDS7IZJYK22r3e_0j98> <https://w3id.org/np/o/ntemplate/wasCreatedFromProvenanceTemplate> <https://w3id.org/np/RA7lSq6MuK_TIC6JMSHvLtee3lpLoZDOqLJCLXevnrPoU> <https://w3id.org/np/RAtobepublished/pubinfo> .
<https://w3id.org/np/RA7pcsWf52tAa1yYMcmlyeT2vsMDS7IZJYK22r3e_0j98> <https://w3id.org/np/o/ntemplate/wasCreatedFromPubinfoTemplate> <https://w3id.org/np/RA0J4vUn_dekg-U1kK3AOEt02p9mT2WO03uGxLDec1jLw> <https://w3id.org/np/RAtobepublished/pubinfo> .
<https://w3id.org/np/RA7pcsWf52tAa1yYMcmlyeT2vsMDS7IZJYK22r3e_0j98> <https://w3id.org/np/o/ntemplate/wasCreatedFromPubinfoTemplate> <https://w3id.org/np/RAukAcWHRDlkqxk7H2XNSegc1WnHI569INvNr-xdptDGI> <https://w3id.org/np/RAtobepublished/pubinfo> .
<https://w3id.org/np/RA7pcsWf52tAa1yYMcmlyeT2vsMDS7IZJYK22r3e_0j98> <https://w3id.org/np/o/ntemplate/wasCreatedFromTemplate> <https://w3id.org/np/RALmXhDw3rHcMveTgbv8VtWxijUHwnSqhCmtJFIPKWVaA> <https://w3id.org/np/RAtobepublished/pubinfo> .
<https://w3id.org/np/RA7pcsWf52tAa1yYMcmlyeT2vsMDS7IZJYK22r3e_0j98/sig> <http://purl.org/nanopub/x/hasAlgorithm> "RSA" <https://w3id.org/np/RAtobepublished/pubinfo> .
<https://w3id.org/np/RA7pcsWf52tAa1yYMcmlyeT2vsMDS7IZJYK22r3e_0j98/sig> <http://purl.org/nanopub/x/hasPublicKey> "MIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKCAQEAosxbitQQzLXi1949Zd9JmSkGfYHHlj/CZZ7iiYs1TrZ5/Jk/wGA7kHEv7f9NtsinOdBo9EtHj/jgHE5W2Vv404JbOAY280PvH5Jns5ObWdVZmtHeCw0ZIdPEqNrurrEweKhzcTJW/YRpYWPwVPo47XyIW6IAcmx6gfdtmdPddMpplqExrP6G99ksXfXlZI0InQtZJRSGK5lYLLNzaofFtupPI5OAAGjooDyHijp0Ap2HIXH6WpO4S44cFPKU34pH2xhIY4/XT5DG1X5UoiVHs2Yoo30BHFudj/kAFwdzcy6Yh4tMDaB3ox6p7pi267d7n0y7kypC0Nt+hfgHQ1FpgwIDAQAB" <https://w3id.org/np/RAtobepublished/pubinfo> .
<https://w3id.org/np/RA7pcsWf52tAa1yYMcmlyeT2vsMDS7IZJYK22r3e_0j98/sig> <http://purl.org/nanopub/x/hasSignature> "nY1oLkTQrEInzC3CN2sxtJCXDq7NTxO+aMvd3euyMAUCxmEkbCa++HT67N5eLNe1ume2AcoQwfHZOCduQDxaOUcwM+0qvnPQuCHL028iPoWoPEqYLwC2Ismo7WQAa18FFevy4iOWY/k4nwIwzNiQGmCSIy6j/Wq91vPC50EzjT49W5pVqeJXub2fgShID1tt7cDE89mWAz6M1NTTBVzvAx3/Mm7WbsmZZpIDsk3UmrYWVrwQI7ehepdBjaEiCzSp3ejccIVyR/yLCV/wuBjOHiEr//U2RFUcFJgQpm3NvhmzCVI1vV1k4mZedKg/NrVd71l9o2EwaP+2gR/TX96a+A==" <https://w3id.org/np/RAtobepublished/pubinfo> .
<https://w3id.org/np/RA7pcsWf52tAa1yYMcmlyeT2vsMDS7IZJYK22r3e_0j98/sig> <http://purl.org/nanopub/x/hasSignatureTarget> <https://w3id.org/np/RA7pcsWf52tAa1yYMcmlyeT2vsMDS7IZJYK22r3e_0j98> <https://w3id.org/np/RAtobepublished/pubinfo> .
<https://w3id.org/np/RA7pcsWf52tAa1yYMcmlyeT2vsMDS7IZJYK22r3e_0j98/sig> <http://purl.org/nanopub/x/signedBy> <https://orcid.org/0000-0002-1784-2920> <https://w3id.org/np/RAtobepublished/pubinfo> .
<https://w3id.org/np/RAvk9pmoZ2IberoDe7zUWV0bVithiy6CnbSG5y06YuKM0/quantum-computing-applications-for-biodiversity-re> <https://w3id.org/np/o/ntemplate/hasLabelFromApi> "Quantum Computing Applications for Biodiversity Research - Systematic Review" <https://w3id.org/np/RAtobepublished/pubinfo> .