<?xml version="1.0" encoding="UTF-8" ?>
<oai_dc:dc schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
<dc:title>2D zernike polynomial expansion: finding the protein-protein binding regions</dc:title>
<dc:creator>Milanetti, Edoardo</dc:creator>
<dc:creator>Miotto, Mattia</dc:creator>
<dc:creator>Di Rienzo, Lorenzo</dc:creator>
<dc:creator>Monti, Michele</dc:creator>
<dc:creator>Gosti, Giorgio</dc:creator>
<dc:creator>Ruocco, Giancarlo</dc:creator>
<dc:subject>Proteïnes</dc:subject>
<dc:subject>Molècules</dc:subject>
<dc:description>We present a method for efficiently and effectively assessing whether and where two proteins can interact with each other to form a complex. This is still largely an open problem, even for those relatively few cases where the 3D structure of both proteins is known. In fact, even if much of the information about the interaction is encoded in the chemical and geometric features of the structures, the set of possible contact patches and of their relative orientations are too large to be computationally affordable in a reasonable time, thus preventing the compilation of reliable interactome. Our method is able to rapidly and quantitatively measure the geometrical shape complementarity between interacting proteins, comparing their molecular iso-electron density surfaces expanding the surface patches in term of 2D Zernike polynomials. We first test the method against the real binding region of a large dataset of known protein complexes, reaching a success rate of 0.72. We then apply the method for the blind recognition of binding sites, identifying the real region of interaction in about 60% of the analyzed cases. Finally, we investigate how the efficiency in finding the right binding region depends on the surface roughness as a function of the expansion order.</dc:description>
<dc:description>Michele Monti acknowledges funding through the H2020 project IN-FORE 825080</dc:description>
<dc:date>2020</dc:date>
<dc:type>info:eu-repo/semantics/article</dc:type>
<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
<dc:identifier>Milanetti E, Miotto M, Di Rienzo L, Monti M, Gosti G, Ruocco G. 2D zernike polynomial expansion: finding the protein-protein binding regions. Comput Struct Biotechnol J. 2020 Dec 4;19:29-36. DOI:10.1016/j.csbj.2020.11.051</dc:identifier>
<dc:identifier>2001-0370</dc:identifier>
<dc:identifier>http://hdl.handle.net/10230/52911</dc:identifier>
<dc:identifier>http://dx.doi.org/10.1016/j.csbj.2020.11.051</dc:identifier>
<dc:language>eng</dc:language>
<dc:relation>info:eu-repo/grantAgreement/EC/H2020/825080</dc:relation>
<dc:rights>© 2020 Published by Elsevier B.V. on behalf of Research Network of Computational and Structural Biotechnology. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)</dc:rights>
<dc:rights>http://creativecommons.org/licenses/by-nc-nd/4.0/</dc:rights>
<dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
<dc:format>application/pdf</dc:format>
<dc:publisher>Elsevier</dc:publisher>
</oai_dc:dc>
<?xml version="1.0" encoding="UTF-8" ?>
<d:DIDL schemaLocation="urn:mpeg:mpeg21:2002:02-DIDL-NS http://standards.iso.org/ittf/PubliclyAvailableStandards/MPEG-21_schema_files/did/didl.xsd">
<d:DIDLInfo>
<dcterms:created schemaLocation="http://purl.org/dc/terms/ http://dublincore.org/schemas/xmls/qdc/dcterms.xsd">2022-04-27T10:57:47Z</dcterms:created>
</d:DIDLInfo>
<d:Item id="hdl_10230_52911">
<d:Descriptor>
<d:Statement mimeType="application/xml; charset=utf-8">
<dii:Identifier schemaLocation="urn:mpeg:mpeg21:2002:01-DII-NS http://standards.iso.org/ittf/PubliclyAvailableStandards/MPEG-21_schema_files/dii/dii.xsd">urn:hdl:10230/52911</dii:Identifier>
</d:Statement>
</d:Descriptor>
<d:Descriptor>
<d:Statement mimeType="application/xml; charset=utf-8">
<oai_dc:dc schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
<dc:title>2D zernike polynomial expansion: finding the protein-protein binding regions</dc:title>
<dc:creator>Milanetti, Edoardo</dc:creator>
<dc:creator>Miotto, Mattia</dc:creator>
<dc:creator>Di Rienzo, Lorenzo</dc:creator>
<dc:creator>Monti, Michele</dc:creator>
<dc:creator>Gosti, Giorgio</dc:creator>
<dc:creator>Ruocco, Giancarlo</dc:creator>
<dc:description>We present a method for efficiently and effectively assessing whether and where two proteins can interact with each other to form a complex. This is still largely an open problem, even for those relatively few cases where the 3D structure of both proteins is known. In fact, even if much of the information about the interaction is encoded in the chemical and geometric features of the structures, the set of possible contact patches and of their relative orientations are too large to be computationally affordable in a reasonable time, thus preventing the compilation of reliable interactome. Our method is able to rapidly and quantitatively measure the geometrical shape complementarity between interacting proteins, comparing their molecular iso-electron density surfaces expanding the surface patches in term of 2D Zernike polynomials. We first test the method against the real binding region of a large dataset of known protein complexes, reaching a success rate of 0.72. We then apply the method for the blind recognition of binding sites, identifying the real region of interaction in about 60% of the analyzed cases. Finally, we investigate how the efficiency in finding the right binding region depends on the surface roughness as a function of the expansion order.</dc:description>
<dc:date>2022-04-27T10:57:47Z</dc:date>
<dc:date>2022-04-27T10:57:47Z</dc:date>
<dc:date>2020</dc:date>
<dc:type>info:eu-repo/semantics/article</dc:type>
<dc:identifier>Milanetti E, Miotto M, Di Rienzo L, Monti M, Gosti G, Ruocco G. 2D zernike polynomial expansion: finding the protein-protein binding regions. Comput Struct Biotechnol J. 2020 Dec 4;19:29-36. DOI:10.1016/j.csbj.2020.11.051</dc:identifier>
<dc:identifier>2001-0370</dc:identifier>
<dc:identifier>http://hdl.handle.net/10230/52911</dc:identifier>
<dc:identifier>http://dx.doi.org/10.1016/j.csbj.2020.11.051</dc:identifier>
<dc:language>eng</dc:language>
<dc:relation>info:eu-repo/grantAgreement/EC/H2020/825080</dc:relation>
<dc:rights>http://creativecommons.org/licenses/by-nc-nd/4.0/</dc:rights>
<dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
<dc:rights>© 2020 Published by Elsevier B.V. on behalf of Research Network of Computational and Structural Biotechnology. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)</dc:rights>
<dc:publisher>Elsevier</dc:publisher>
</oai_dc:dc>
</d:Statement>
</d:Descriptor>
<d:Component id="10230_52911_1">
</d:Component>
</d:Item>
</d:DIDL>
<?xml version="1.0" encoding="UTF-8" ?>
<dim:dim schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
<dim:field element="contributor" mdschema="dc" qualifier="author">Milanetti, Edoardo</dim:field>
<dim:field element="contributor" mdschema="dc" qualifier="author">Miotto, Mattia</dim:field>
<dim:field element="contributor" mdschema="dc" qualifier="author">Di Rienzo, Lorenzo</dim:field>
<dim:field element="contributor" mdschema="dc" qualifier="author">Monti, Michele</dim:field>
<dim:field element="contributor" mdschema="dc" qualifier="author">Gosti, Giorgio</dim:field>
<dim:field element="contributor" mdschema="dc" qualifier="author">Ruocco, Giancarlo</dim:field>
<dim:field element="date" mdschema="dc" qualifier="accessioned">2022-04-27T10:57:47Z</dim:field>
<dim:field element="date" mdschema="dc" qualifier="available">2022-04-27T10:57:47Z</dim:field>
<dim:field element="date" mdschema="dc" qualifier="issued">2020</dim:field>
<dim:field element="identifier" mdschema="dc" qualifier="citation">Milanetti E, Miotto M, Di Rienzo L, Monti M, Gosti G, Ruocco G. 2D zernike polynomial expansion: finding the protein-protein binding regions. Comput Struct Biotechnol J. 2020 Dec 4;19:29-36. DOI:10.1016/j.csbj.2020.11.051</dim:field>
<dim:field element="identifier" mdschema="dc" qualifier="issn">2001-0370</dim:field>
<dim:field element="identifier" mdschema="dc" qualifier="uri">http://hdl.handle.net/10230/52911</dim:field>
<dim:field element="identifier" mdschema="dc" qualifier="doi">http://dx.doi.org/10.1016/j.csbj.2020.11.051</dim:field>
<dim:field element="description" mdschema="dc" qualifier="abstract">We present a method for efficiently and effectively assessing whether and where two proteins can interact with each other to form a complex. This is still largely an open problem, even for those relatively few cases where the 3D structure of both proteins is known. In fact, even if much of the information about the interaction is encoded in the chemical and geometric features of the structures, the set of possible contact patches and of their relative orientations are too large to be computationally affordable in a reasonable time, thus preventing the compilation of reliable interactome. Our method is able to rapidly and quantitatively measure the geometrical shape complementarity between interacting proteins, comparing their molecular iso-electron density surfaces expanding the surface patches in term of 2D Zernike polynomials. We first test the method against the real binding region of a large dataset of known protein complexes, reaching a success rate of 0.72. We then apply the method for the blind recognition of binding sites, identifying the real region of interaction in about 60% of the analyzed cases. Finally, we investigate how the efficiency in finding the right binding region depends on the surface roughness as a function of the expansion order.</dim:field>
<dim:field element="description" lang="en" mdschema="dc" qualifier="provenance">Made available in DSpace on 2022-04-27T10:57:47Z (GMT). No. of bitstreams: 1 Milanetti_2020.pdf: 2162631 bytes, checksum: 0a1bbc6cadbe6edc55c4bd9b29b43e54 (MD5) Previous issue date: 2020</dim:field>
<dim:field element="description" mdschema="dc" qualifier="sponsorship">Michele Monti acknowledges funding through the H2020 project IN-FORE 825080</dim:field>
<dim:field element="format" mdschema="dc" qualifier="mimetype">application/pdf</dim:field>
<dim:field element="language" mdschema="dc" qualifier="iso">eng</dim:field>
<dim:field element="publisher" mdschema="dc">Elsevier</dim:field>
<dim:field element="rights" mdschema="dc">© 2020 Published by Elsevier B.V. on behalf of Research Network of Computational and Structural Biotechnology. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)</dim:field>
<dim:field element="rights" mdschema="dc" qualifier="uri">http://creativecommons.org/licenses/by-nc-nd/4.0/</dim:field>
<dim:field element="rights" mdschema="dc" qualifier="accessRights">info:eu-repo/semantics/openAccess</dim:field>
<dim:field element="subject" mdschema="dc" qualifier="other">Proteïnes</dim:field>
<dim:field element="subject" mdschema="dc" qualifier="other">Molècules</dim:field>
<dim:field element="title" mdschema="dc">2D zernike polynomial expansion: finding the protein-protein binding regions</dim:field>
<dim:field element="type" mdschema="dc">info:eu-repo/semantics/article</dim:field>
<dim:field element="type" mdschema="dc" qualifier="version">info:eu-repo/semantics/publishedVersion</dim:field>
<dim:field element="relation" mdschema="dc" qualifier="projectID">info:eu-repo/grantAgreement/EC/H2020/825080</dim:field>
</dim:dim>
<?xml version="1.0" encoding="UTF-8" ?>
<thesis schemaLocation="http://www.ndltd.org/standards/metadata/etdms/1.0/ http://www.ndltd.org/standards/metadata/etdms/1.0/etdms.xsd">
<title>2D zernike polynomial expansion: finding the protein-protein binding regions</title>
<creator>Milanetti, Edoardo</creator>
<creator>Miotto, Mattia</creator>
<creator>Di Rienzo, Lorenzo</creator>
<creator>Monti, Michele</creator>
<creator>Gosti, Giorgio</creator>
<creator>Ruocco, Giancarlo</creator>
<description>We present a method for efficiently and effectively assessing whether and where two proteins can interact with each other to form a complex. This is still largely an open problem, even for those relatively few cases where the 3D structure of both proteins is known. In fact, even if much of the information about the interaction is encoded in the chemical and geometric features of the structures, the set of possible contact patches and of their relative orientations are too large to be computationally affordable in a reasonable time, thus preventing the compilation of reliable interactome. Our method is able to rapidly and quantitatively measure the geometrical shape complementarity between interacting proteins, comparing their molecular iso-electron density surfaces expanding the surface patches in term of 2D Zernike polynomials. We first test the method against the real binding region of a large dataset of known protein complexes, reaching a success rate of 0.72. We then apply the method for the blind recognition of binding sites, identifying the real region of interaction in about 60% of the analyzed cases. Finally, we investigate how the efficiency in finding the right binding region depends on the surface roughness as a function of the expansion order.</description>
<date>2022-04-27</date>
<date>2022-04-27</date>
<date>2020</date>
<type>info:eu-repo/semantics/article</type>
<identifier>Milanetti E, Miotto M, Di Rienzo L, Monti M, Gosti G, Ruocco G. 2D zernike polynomial expansion: finding the protein-protein binding regions. Comput Struct Biotechnol J. 2020 Dec 4;19:29-36. DOI:10.1016/j.csbj.2020.11.051</identifier>
<identifier>2001-0370</identifier>
<identifier>http://hdl.handle.net/10230/52911</identifier>
<identifier>http://dx.doi.org/10.1016/j.csbj.2020.11.051</identifier>
<language>eng</language>
<relation>info:eu-repo/grantAgreement/EC/H2020/825080</relation>
<rights>http://creativecommons.org/licenses/by-nc-nd/4.0/</rights>
<rights>info:eu-repo/semantics/openAccess</rights>
<rights>© 2020 Published by Elsevier B.V. on behalf of Research Network of Computational and Structural Biotechnology. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)</rights>
<publisher>Elsevier</publisher>
</thesis>
<?xml version="1.0" encoding="UTF-8" ?>
<record schemaLocation="http://www.loc.gov/MARC21/slim http://www.loc.gov/standards/marcxml/schema/MARC21slim.xsd">
<leader>00925njm 22002777a 4500</leader>
<datafield ind1=" " ind2=" " tag="042">
<subfield code="a">dc</subfield>
</datafield>
<datafield ind1=" " ind2=" " tag="720">
<subfield code="a">Milanetti, Edoardo</subfield>
<subfield code="e">author</subfield>
</datafield>
<datafield ind1=" " ind2=" " tag="720">
<subfield code="a">Miotto, Mattia</subfield>
<subfield code="e">author</subfield>
</datafield>
<datafield ind1=" " ind2=" " tag="720">
<subfield code="a">Di Rienzo, Lorenzo</subfield>
<subfield code="e">author</subfield>
</datafield>
<datafield ind1=" " ind2=" " tag="720">
<subfield code="a">Monti, Michele</subfield>
<subfield code="e">author</subfield>
</datafield>
<datafield ind1=" " ind2=" " tag="720">
<subfield code="a">Gosti, Giorgio</subfield>
<subfield code="e">author</subfield>
</datafield>
<datafield ind1=" " ind2=" " tag="720">
<subfield code="a">Ruocco, Giancarlo</subfield>
<subfield code="e">author</subfield>
</datafield>
<datafield ind1=" " ind2=" " tag="260">
<subfield code="c">2020</subfield>
</datafield>
<datafield ind1=" " ind2=" " tag="520">
<subfield code="a">We present a method for efficiently and effectively assessing whether and where two proteins can interact with each other to form a complex. This is still largely an open problem, even for those relatively few cases where the 3D structure of both proteins is known. In fact, even if much of the information about the interaction is encoded in the chemical and geometric features of the structures, the set of possible contact patches and of their relative orientations are too large to be computationally affordable in a reasonable time, thus preventing the compilation of reliable interactome. Our method is able to rapidly and quantitatively measure the geometrical shape complementarity between interacting proteins, comparing their molecular iso-electron density surfaces expanding the surface patches in term of 2D Zernike polynomials. We first test the method against the real binding region of a large dataset of known protein complexes, reaching a success rate of 0.72. We then apply the method for the blind recognition of binding sites, identifying the real region of interaction in about 60% of the analyzed cases. Finally, we investigate how the efficiency in finding the right binding region depends on the surface roughness as a function of the expansion order.</subfield>
</datafield>
<datafield ind1="8" ind2=" " tag="024">
<subfield code="a">Milanetti E, Miotto M, Di Rienzo L, Monti M, Gosti G, Ruocco G. 2D zernike polynomial expansion: finding the protein-protein binding regions. Comput Struct Biotechnol J. 2020 Dec 4;19:29-36. DOI:10.1016/j.csbj.2020.11.051</subfield>
</datafield>
<datafield ind1="8" ind2=" " tag="024">
<subfield code="a">2001-0370</subfield>
</datafield>
<datafield ind1="8" ind2=" " tag="024">
<subfield code="a">http://hdl.handle.net/10230/52911</subfield>
</datafield>
<datafield ind1="8" ind2=" " tag="024">
<subfield code="a">http://dx.doi.org/10.1016/j.csbj.2020.11.051</subfield>
</datafield>
<datafield ind1="0" ind2="0" tag="245">
<subfield code="a">2D zernike polynomial expansion: finding the protein-protein binding regions</subfield>
</datafield>
</record>
<?xml version="1.0" encoding="UTF-8" ?>
<mets ID=" DSpace_ITEM_10230-52911" OBJID=" hdl:10230/52911" PROFILE="DSpace METS SIP Profile 1.0" TYPE="DSpace ITEM" schemaLocation="http://www.loc.gov/METS/ http://www.loc.gov/standards/mets/mets.xsd">
<metsHdr CREATEDATE="2022-11-16T01:57:30Z">
<agent ROLE="CUSTODIAN" TYPE="ORGANIZATION">
<name>Repositori digital de la UPF</name>
</agent>
</metsHdr>
<dmdSec ID="DMD_10230_52911">
<mdWrap MDTYPE="MODS">
<xmlData schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-1.xsd">
<mods:mods schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-1.xsd">
<mods:name>
<mods:role>
<mods:roleTerm type="text">author</mods:roleTerm>
</mods:role>
<mods:namePart>Milanetti, Edoardo</mods:namePart>
</mods:name>
<mods:name>
<mods:role>
<mods:roleTerm type="text">author</mods:roleTerm>
</mods:role>
<mods:namePart>Miotto, Mattia</mods:namePart>
</mods:name>
<mods:name>
<mods:role>
<mods:roleTerm type="text">author</mods:roleTerm>
</mods:role>
<mods:namePart>Di Rienzo, Lorenzo</mods:namePart>
</mods:name>
<mods:name>
<mods:role>
<mods:roleTerm type="text">author</mods:roleTerm>
</mods:role>
<mods:namePart>Monti, Michele</mods:namePart>
</mods:name>
<mods:name>
<mods:role>
<mods:roleTerm type="text">author</mods:roleTerm>
</mods:role>
<mods:namePart>Gosti, Giorgio</mods:namePart>
</mods:name>
<mods:name>
<mods:role>
<mods:roleTerm type="text">author</mods:roleTerm>
</mods:role>
<mods:namePart>Ruocco, Giancarlo</mods:namePart>
</mods:name>
<mods:extension>
<mods:dateAccessioned encoding="iso8601">2022-04-27T10:57:47Z</mods:dateAccessioned>
</mods:extension>
<mods:extension>
<mods:dateAvailable encoding="iso8601">2022-04-27T10:57:47Z</mods:dateAvailable>
</mods:extension>
<mods:originInfo>
<mods:dateIssued encoding="iso8601">2020</mods:dateIssued>
</mods:originInfo>
<mods:identifier type="citation">Milanetti E, Miotto M, Di Rienzo L, Monti M, Gosti G, Ruocco G. 2D zernike polynomial expansion: finding the protein-protein binding regions. Comput Struct Biotechnol J. 2020 Dec 4;19:29-36. DOI:10.1016/j.csbj.2020.11.051</mods:identifier>
<mods:identifier type="issn">2001-0370</mods:identifier>
<mods:identifier type="uri">http://hdl.handle.net/10230/52911</mods:identifier>
<mods:identifier type="doi">http://dx.doi.org/10.1016/j.csbj.2020.11.051</mods:identifier>
<mods:abstract>We present a method for efficiently and effectively assessing whether and where two proteins can interact with each other to form a complex. This is still largely an open problem, even for those relatively few cases where the 3D structure of both proteins is known. In fact, even if much of the information about the interaction is encoded in the chemical and geometric features of the structures, the set of possible contact patches and of their relative orientations are too large to be computationally affordable in a reasonable time, thus preventing the compilation of reliable interactome. Our method is able to rapidly and quantitatively measure the geometrical shape complementarity between interacting proteins, comparing their molecular iso-electron density surfaces expanding the surface patches in term of 2D Zernike polynomials. We first test the method against the real binding region of a large dataset of known protein complexes, reaching a success rate of 0.72. We then apply the method for the blind recognition of binding sites, identifying the real region of interaction in about 60% of the analyzed cases. Finally, we investigate how the efficiency in finding the right binding region depends on the surface roughness as a function of the expansion order.</mods:abstract>
<mods:language>
<mods:languageTerm authority="rfc3066">eng</mods:languageTerm>
</mods:language>
<mods:accessCondition type="useAndReproduction">© 2020 Published by Elsevier B.V. on behalf of Research Network of Computational and Structural Biotechnology. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)</mods:accessCondition>
<mods:titleInfo>
<mods:title>2D zernike polynomial expansion: finding the protein-protein binding regions</mods:title>
</mods:titleInfo>
<mods:genre>info:eu-repo/semantics/article</mods:genre>
</mods:mods>
</xmlData>
</mdWrap>
</dmdSec>
<amdSec ID="FO_10230_52911_1">
<techMD ID="TECH_O_10230_52911_1">
<mdWrap MDTYPE="PREMIS">
<xmlData schemaLocation="http://www.loc.gov/standards/premis http://www.loc.gov/standards/premis/PREMIS-v1-0.xsd">
<premis:premis>
<premis:object>
<premis:objectIdentifier>
<premis:objectIdentifierType>URL</premis:objectIdentifierType>
<premis:objectIdentifierValue>http://repositori.upf.edu/bitstream/10230/52911/1/Milanetti_2020.pdf</premis:objectIdentifierValue>
</premis:objectIdentifier>
<premis:objectCategory>File</premis:objectCategory>
<premis:objectCharacteristics>
<premis:fixity>
<premis:messageDigestAlgorithm>MD5</premis:messageDigestAlgorithm>
<premis:messageDigest>0a1bbc6cadbe6edc55c4bd9b29b43e54</premis:messageDigest>
</premis:fixity>
<premis:size>2162631</premis:size>
<premis:format>
<premis:formatDesignation>
<premis:formatName>application/pdf</premis:formatName>
</premis:formatDesignation>
</premis:format>
</premis:objectCharacteristics>
<premis:originalName>Milanetti_2020.pdf</premis:originalName>
</premis:object>
</premis:premis>
</xmlData>
</mdWrap>
</techMD>
</amdSec>
<amdSec ID="FT_10230_52911_2">
<techMD ID="TECH_T_10230_52911_2">
<mdWrap MDTYPE="PREMIS">
<xmlData schemaLocation="http://www.loc.gov/standards/premis http://www.loc.gov/standards/premis/PREMIS-v1-0.xsd">
<premis:premis>
<premis:object>
<premis:objectIdentifier>
<premis:objectIdentifierType>URL</premis:objectIdentifierType>
<premis:objectIdentifierValue>http://repositori.upf.edu/bitstream/10230/52911/2/Milanetti_2020.pdf.txt</premis:objectIdentifierValue>
</premis:objectIdentifier>
<premis:objectCategory>File</premis:objectCategory>
<premis:objectCharacteristics>
<premis:fixity>
<premis:messageDigestAlgorithm>MD5</premis:messageDigestAlgorithm>
<premis:messageDigest>a09f0f2ac98875671bc38fc5639c1e4b</premis:messageDigest>
</premis:fixity>
<premis:size>46586</premis:size>
<premis:format>
<premis:formatDesignation>
<premis:formatName>text/plain</premis:formatName>
</premis:formatDesignation>
</premis:format>
</premis:objectCharacteristics>
<premis:originalName>Milanetti_2020.pdf.txt</premis:originalName>
</premis:object>
</premis:premis>
</xmlData>
</mdWrap>
</techMD>
</amdSec>
<fileSec>
<fileGrp USE="ORIGINAL">
<file ADMID="FO_10230_52911_1" CHECKSUM="0a1bbc6cadbe6edc55c4bd9b29b43e54" CHECKSUMTYPE="MD5" GROUPID="GROUP_BITSTREAM_10230_52911_1" ID="BITSTREAM_ORIGINAL_10230_52911_1" MIMETYPE="application/pdf" SEQ="1" SIZE="2162631">
</file>
</fileGrp>
<fileGrp USE="TEXT">
<file ADMID="FT_10230_52911_2" CHECKSUM="a09f0f2ac98875671bc38fc5639c1e4b" CHECKSUMTYPE="MD5" GROUPID="GROUP_BITSTREAM_10230_52911_2" ID="BITSTREAM_TEXT_10230_52911_2" MIMETYPE="text/plain" SEQ="2" SIZE="46586">
</file>
</fileGrp>
</fileSec>
<structMap LABEL="DSpace Object" TYPE="LOGICAL">
<div ADMID="DMD_10230_52911" TYPE="DSpace Object Contents">
<div TYPE="DSpace BITSTREAM">
</div>
</div>
</structMap>
</mets>
<?xml version="1.0" encoding="UTF-8" ?>
<mods:mods schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-1.xsd">
<mods:name>
<mods:namePart>Milanetti, Edoardo</mods:namePart>
</mods:name>
<mods:name>
<mods:namePart>Miotto, Mattia</mods:namePart>
</mods:name>
<mods:name>
<mods:namePart>Di Rienzo, Lorenzo</mods:namePart>
</mods:name>
<mods:name>
<mods:namePart>Monti, Michele</mods:namePart>
</mods:name>
<mods:name>
<mods:namePart>Gosti, Giorgio</mods:namePart>
</mods:name>
<mods:name>
<mods:namePart>Ruocco, Giancarlo</mods:namePart>
</mods:name>
<mods:extension>
<mods:dateAvailable encoding="iso8601">2022-04-27T10:57:47Z</mods:dateAvailable>
</mods:extension>
<mods:extension>
<mods:dateAccessioned encoding="iso8601">2022-04-27T10:57:47Z</mods:dateAccessioned>
</mods:extension>
<mods:originInfo>
<mods:dateIssued encoding="iso8601">2020</mods:dateIssued>
</mods:originInfo>
<mods:identifier type="citation">Milanetti E, Miotto M, Di Rienzo L, Monti M, Gosti G, Ruocco G. 2D zernike polynomial expansion: finding the protein-protein binding regions. Comput Struct Biotechnol J. 2020 Dec 4;19:29-36. DOI:10.1016/j.csbj.2020.11.051</mods:identifier>
<mods:identifier type="issn">2001-0370</mods:identifier>
<mods:identifier type="uri">http://hdl.handle.net/10230/52911</mods:identifier>
<mods:identifier type="doi">http://dx.doi.org/10.1016/j.csbj.2020.11.051</mods:identifier>
<mods:abstract>We present a method for efficiently and effectively assessing whether and where two proteins can interact with each other to form a complex. This is still largely an open problem, even for those relatively few cases where the 3D structure of both proteins is known. In fact, even if much of the information about the interaction is encoded in the chemical and geometric features of the structures, the set of possible contact patches and of their relative orientations are too large to be computationally affordable in a reasonable time, thus preventing the compilation of reliable interactome. Our method is able to rapidly and quantitatively measure the geometrical shape complementarity between interacting proteins, comparing their molecular iso-electron density surfaces expanding the surface patches in term of 2D Zernike polynomials. We first test the method against the real binding region of a large dataset of known protein complexes, reaching a success rate of 0.72. We then apply the method for the blind recognition of binding sites, identifying the real region of interaction in about 60% of the analyzed cases. Finally, we investigate how the efficiency in finding the right binding region depends on the surface roughness as a function of the expansion order.</mods:abstract>
<mods:language>
<mods:languageTerm>eng</mods:languageTerm>
</mods:language>
<mods:accessCondition type="useAndReproduction">http://creativecommons.org/licenses/by-nc-nd/4.0/</mods:accessCondition>
<mods:accessCondition type="useAndReproduction">info:eu-repo/semantics/openAccess</mods:accessCondition>
<mods:accessCondition type="useAndReproduction">© 2020 Published by Elsevier B.V. on behalf of Research Network of Computational and Structural Biotechnology. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)</mods:accessCondition>
<mods:titleInfo>
<mods:title>2D zernike polynomial expansion: finding the protein-protein binding regions</mods:title>
</mods:titleInfo>
<mods:genre>info:eu-repo/semantics/article</mods:genre>
</mods:mods>
<?xml version="1.0" encoding="UTF-8" ?>
<atom:entry schemaLocation="http://www.w3.org/2005/Atom http://www.kbcafe.com/rss/atom.xsd.xml">
<atom:id>http://oai-repositori.upf.edu/oai/metadata/handle/10230/52911/ore.xml</atom:id>
<atom:published>2022-04-27T10:57:47Z</atom:published>
<atom:updated>2022-04-27T10:57:47Z</atom:updated>
<atom:source>
<atom:generator>Repositori digital de la UPF</atom:generator>
</atom:source>
<atom:title>2D zernike polynomial expansion: finding the protein-protein binding regions</atom:title>
<atom:author>
<atom:name>Milanetti, Edoardo</atom:name>
</atom:author>
<atom:author>
<atom:name>Miotto, Mattia</atom:name>
</atom:author>
<atom:author>
<atom:name>Di Rienzo, Lorenzo</atom:name>
</atom:author>
<atom:author>
<atom:name>Monti, Michele</atom:name>
</atom:author>
<atom:author>
<atom:name>Gosti, Giorgio</atom:name>
</atom:author>
<atom:author>
<atom:name>Ruocco, Giancarlo</atom:name>
</atom:author>
<oreatom:triples>
<rdf:Description about="http://oai-repositori.upf.edu/oai/metadata/handle/10230/52911/ore.xml#atom">
<dcterms:modified>2022-04-27T10:57:47Z</dcterms:modified>
</rdf:Description>
<rdf:Description about="http://repositori.upf.edu/bitstream/10230/52911/3/Milanetti_2020.pdf.jpg">
<dcterms:description>THUMBNAIL</dcterms:description>
</rdf:Description>
<rdf:Description about="http://repositori.upf.edu/bitstream/10230/52911/2/Milanetti_2020.pdf.txt">
<dcterms:description>TEXT</dcterms:description>
</rdf:Description>
<rdf:Description about="http://repositori.upf.edu/bitstream/10230/52911/1/Milanetti_2020.pdf">
<dcterms:description>ORIGINAL</dcterms:description>
</rdf:Description>
</oreatom:triples>
</atom:entry>
<?xml version="1.0" encoding="UTF-8" ?>
<qdc:qualifieddc schemaLocation="http://purl.org/dc/elements/1.1/ http://dublincore.org/schemas/xmls/qdc/2006/01/06/dc.xsd http://purl.org/dc/terms/ http://dublincore.org/schemas/xmls/qdc/2006/01/06/dcterms.xsd http://dspace.org/qualifieddc/ http://www.ukoln.ac.uk/metadata/dcmi/xmlschema/qualifieddc.xsd">
<dc:title>2D zernike polynomial expansion: finding the protein-protein binding regions</dc:title>
<dc:creator>Milanetti, Edoardo</dc:creator>
<dc:creator>Miotto, Mattia</dc:creator>
<dc:creator>Di Rienzo, Lorenzo</dc:creator>
<dc:creator>Monti, Michele</dc:creator>
<dc:creator>Gosti, Giorgio</dc:creator>
<dc:creator>Ruocco, Giancarlo</dc:creator>
<dcterms:abstract>We present a method for efficiently and effectively assessing whether and where two proteins can interact with each other to form a complex. This is still largely an open problem, even for those relatively few cases where the 3D structure of both proteins is known. In fact, even if much of the information about the interaction is encoded in the chemical and geometric features of the structures, the set of possible contact patches and of their relative orientations are too large to be computationally affordable in a reasonable time, thus preventing the compilation of reliable interactome. Our method is able to rapidly and quantitatively measure the geometrical shape complementarity between interacting proteins, comparing their molecular iso-electron density surfaces expanding the surface patches in term of 2D Zernike polynomials. We first test the method against the real binding region of a large dataset of known protein complexes, reaching a success rate of 0.72. We then apply the method for the blind recognition of binding sites, identifying the real region of interaction in about 60% of the analyzed cases. Finally, we investigate how the efficiency in finding the right binding region depends on the surface roughness as a function of the expansion order.</dcterms:abstract>
<dc:date>2020</dc:date>
<dc:type>info:eu-repo/semantics/article</dc:type>
<dc:identifier>Milanetti E, Miotto M, Di Rienzo L, Monti M, Gosti G, Ruocco G. 2D zernike polynomial expansion: finding the protein-protein binding regions. Comput Struct Biotechnol J. 2020 Dec 4;19:29-36. DOI:10.1016/j.csbj.2020.11.051</dc:identifier>
<dc:identifier>2001-0370</dc:identifier>
<dc:identifier>http://hdl.handle.net/10230/52911</dc:identifier>
<dc:identifier>http://dx.doi.org/10.1016/j.csbj.2020.11.051</dc:identifier>
<dc:language>eng</dc:language>
<dc:relation>info:eu-repo/grantAgreement/EC/H2020/825080</dc:relation>
<dc:rights>http://creativecommons.org/licenses/by-nc-nd/4.0/</dc:rights>
<dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
<dc:rights>© 2020 Published by Elsevier B.V. on behalf of Research Network of Computational and Structural Biotechnology. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)</dc:rights>
<dc:publisher>Elsevier</dc:publisher>
</qdc:qualifieddc>
<?xml version="1.0" encoding="UTF-8" ?>
<rdf:RDF schemaLocation="http://www.openarchives.org/OAI/2.0/rdf/ http://www.openarchives.org/OAI/2.0/rdf.xsd">
<ow:Publication about="oai:repositori.upf.edu:10230/52911">
<dc:title>2D zernike polynomial expansion: finding the protein-protein binding regions</dc:title>
<dc:creator>Milanetti, Edoardo</dc:creator>
<dc:creator>Miotto, Mattia</dc:creator>
<dc:creator>Di Rienzo, Lorenzo</dc:creator>
<dc:creator>Monti, Michele</dc:creator>
<dc:creator>Gosti, Giorgio</dc:creator>
<dc:creator>Ruocco, Giancarlo</dc:creator>
<dc:description>We present a method for efficiently and effectively assessing whether and where two proteins can interact with each other to form a complex. This is still largely an open problem, even for those relatively few cases where the 3D structure of both proteins is known. In fact, even if much of the information about the interaction is encoded in the chemical and geometric features of the structures, the set of possible contact patches and of their relative orientations are too large to be computationally affordable in a reasonable time, thus preventing the compilation of reliable interactome. Our method is able to rapidly and quantitatively measure the geometrical shape complementarity between interacting proteins, comparing their molecular iso-electron density surfaces expanding the surface patches in term of 2D Zernike polynomials. We first test the method against the real binding region of a large dataset of known protein complexes, reaching a success rate of 0.72. We then apply the method for the blind recognition of binding sites, identifying the real region of interaction in about 60% of the analyzed cases. Finally, we investigate how the efficiency in finding the right binding region depends on the surface roughness as a function of the expansion order.</dc:description>
<dc:date>2020</dc:date>
<dc:type>info:eu-repo/semantics/article</dc:type>
<dc:identifier>Milanetti E, Miotto M, Di Rienzo L, Monti M, Gosti G, Ruocco G. 2D zernike polynomial expansion: finding the protein-protein binding regions. Comput Struct Biotechnol J. 2020 Dec 4;19:29-36. DOI:10.1016/j.csbj.2020.11.051</dc:identifier>
<dc:identifier>2001-0370</dc:identifier>
<dc:identifier>http://hdl.handle.net/10230/52911</dc:identifier>
<dc:identifier>http://dx.doi.org/10.1016/j.csbj.2020.11.051</dc:identifier>
<dc:language>eng</dc:language>
<dc:relation>info:eu-repo/grantAgreement/EC/H2020/825080</dc:relation>
<dc:rights>http://creativecommons.org/licenses/by-nc-nd/4.0/</dc:rights>
<dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
<dc:rights>© 2020 Published by Elsevier B.V. on behalf of Research Network of Computational and Structural Biotechnology. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)</dc:rights>
<dc:publisher>Elsevier</dc:publisher>
</ow:Publication>
</rdf:RDF>
<?xml version="1.0" encoding="UTF-8" ?>
<metadata schemaLocation="http://www.lyncode.com/xoai http://www.lyncode.com/xsd/xoai.xsd">
<element name="dc">
<element name="contributor">
<element name="author">
<element name="none">
<field name="value">Milanetti, Edoardo</field>
<field name="value">Miotto, Mattia</field>
<field name="value">Di Rienzo, Lorenzo</field>
<field name="value">Monti, Michele</field>
<field name="value">Gosti, Giorgio</field>
<field name="value">Ruocco, Giancarlo</field>
</element>
</element>
</element>
<element name="date">
<element name="accessioned">
<element name="none">
<field name="value">2022-04-27T10:57:47Z</field>
</element>
</element>
<element name="available">
<element name="none">
<field name="value">2022-04-27T10:57:47Z</field>
</element>
</element>
<element name="issued">
<element name="none">
<field name="value">2020</field>
</element>
</element>
</element>
<element name="identifier">
<element name="citation">
<element name="none">
<field name="value">Milanetti E, Miotto M, Di Rienzo L, Monti M, Gosti G, Ruocco G. 2D zernike polynomial expansion: finding the protein-protein binding regions. Comput Struct Biotechnol J. 2020 Dec 4;19:29-36. DOI:10.1016/j.csbj.2020.11.051</field>
</element>
</element>
<element name="issn">
<element name="none">
<field name="value">2001-0370</field>
</element>
</element>
<element name="uri">
<element name="none">
<field name="value">http://hdl.handle.net/10230/52911</field>
</element>
</element>
<element name="doi">
<element name="none">
<field name="value">http://dx.doi.org/10.1016/j.csbj.2020.11.051</field>
</element>
</element>
</element>
<element name="description">
<element name="abstract">
<element name="none">
<field name="value">We present a method for efficiently and effectively assessing whether and where two proteins can interact with each other to form a complex. This is still largely an open problem, even for those relatively few cases where the 3D structure of both proteins is known. In fact, even if much of the information about the interaction is encoded in the chemical and geometric features of the structures, the set of possible contact patches and of their relative orientations are too large to be computationally affordable in a reasonable time, thus preventing the compilation of reliable interactome. Our method is able to rapidly and quantitatively measure the geometrical shape complementarity between interacting proteins, comparing their molecular iso-electron density surfaces expanding the surface patches in term of 2D Zernike polynomials. We first test the method against the real binding region of a large dataset of known protein complexes, reaching a success rate of 0.72. We then apply the method for the blind recognition of binding sites, identifying the real region of interaction in about 60% of the analyzed cases. Finally, we investigate how the efficiency in finding the right binding region depends on the surface roughness as a function of the expansion order.</field>
</element>
</element>
<element name="provenance">
<element name="en">
<field name="value">Made available in DSpace on 2022-04-27T10:57:47Z (GMT). No. of bitstreams: 1 Milanetti_2020.pdf: 2162631 bytes, checksum: 0a1bbc6cadbe6edc55c4bd9b29b43e54 (MD5) Previous issue date: 2020</field>
</element>
</element>
<element name="sponsorship">
<element name="none">
<field name="value">Michele Monti acknowledges funding through the H2020 project IN-FORE 825080</field>
</element>
</element>
</element>
<element name="format">
<element name="mimetype">
<element name="none">
<field name="value">application/pdf</field>
</element>
</element>
</element>
<element name="language">
<element name="iso">
<element name="none">
<field name="value">eng</field>
</element>
</element>
</element>
<element name="publisher">
<element name="none">
<field name="value">Elsevier</field>
</element>
</element>
<element name="rights">
<element name="none">
<field name="value">© 2020 Published by Elsevier B.V. on behalf of Research Network of Computational and Structural Biotechnology. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)</field>
</element>
<element name="uri">
<element name="none">
<field name="value">http://creativecommons.org/licenses/by-nc-nd/4.0/</field>
</element>
</element>
<element name="accessRights">
<element name="none">
<field name="value">info:eu-repo/semantics/openAccess</field>
</element>
</element>
</element>
<element name="subject">
<element name="other">
<element name="none">
<field name="value">Proteïnes</field>
<field name="value">Molècules</field>
</element>
</element>
</element>
<element name="title">
<element name="none">
<field name="value">2D zernike polynomial expansion: finding the protein-protein binding regions</field>
</element>
</element>
<element name="type">
<element name="none">
<field name="value">info:eu-repo/semantics/article</field>
</element>
<element name="version">
<element name="none">
<field name="value">info:eu-repo/semantics/publishedVersion</field>
</element>
</element>
</element>
<element name="relation">
<element name="projectID">
<element name="none">
<field name="value">info:eu-repo/grantAgreement/EC/H2020/825080</field>
</element>
</element>
</element>
</element>
<element name="bundles">
<element name="bundle">
<field name="name">THUMBNAIL</field>
<element name="bitstreams">
<element name="bitstream">
<field name="name">Milanetti_2020.pdf.jpg</field>
<field name="originalName">Milanetti_2020.pdf.jpg</field>
<field name="description">IM Thumbnail</field>
<field name="format">image/jpeg</field>
<field name="size">38867</field>
<field name="url">http://repositori.upf.edu/bitstream/10230/52911/3/Milanetti_2020.pdf.jpg</field>
<field name="checksum">71af6a9294ae330b68d0fe6726b6c03c</field>
<field name="checksumAlgorithm">MD5</field>
<field name="sid">3</field>
</element>
</element>
</element>
<element name="bundle">
<field name="name">TEXT</field>
<element name="bitstreams">
<element name="bitstream">
<field name="name">Milanetti_2020.pdf.txt</field>
<field name="originalName">Milanetti_2020.pdf.txt</field>
<field name="description">Extracted text</field>
<field name="format">text/plain</field>
<field name="size">46586</field>
<field name="url">http://repositori.upf.edu/bitstream/10230/52911/2/Milanetti_2020.pdf.txt</field>
<field name="checksum">a09f0f2ac98875671bc38fc5639c1e4b</field>
<field name="checksumAlgorithm">MD5</field>
<field name="sid">2</field>
</element>
</element>
</element>
<element name="bundle">
<field name="name">ORIGINAL</field>
<element name="bitstreams">
<element name="bitstream">
<field name="name">Milanetti_2020.pdf</field>
<field name="format">application/pdf</field>
<field name="size">2162631</field>
<field name="url">http://repositori.upf.edu/bitstream/10230/52911/1/Milanetti_2020.pdf</field>
<field name="checksum">0a1bbc6cadbe6edc55c4bd9b29b43e54</field>
<field name="checksumAlgorithm">MD5</field>
<field name="sid">1</field>
</element>
</element>
</element>
</element>
<element name="others">
<field name="handle">10230/52911</field>
<field name="identifier">oai:repositori.upf.edu:10230/52911</field>
<field name="lastModifyDate">2022-04-28 03:32:12.865</field>
</element>
<element name="repository">
<field name="name">Repositori digital de la UPF</field>
<field name="mail">repositori@upf.edu</field>
</element>
</metadata>