Presentation Open Access

Precursor-free and fast spectral library search using approximate nearest neighbor techniques

Bittremieux, Wout; Laukens, Kris

DCAT Export

<?xml version='1.0' encoding='utf-8'?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:adms="http://www.w3.org/ns/adms#" xmlns:cnt="http://www.w3.org/2011/content#" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dct="http://purl.org/dc/terms/" xmlns:dctype="http://purl.org/dc/dcmitype/" xmlns:dcat="http://www.w3.org/ns/dcat#" xmlns:duv="http://www.w3.org/ns/duv#" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:frapo="http://purl.org/cerif/frapo/" xmlns:geo="http://www.w3.org/2003/01/geo/wgs84_pos#" xmlns:gsp="http://www.opengis.net/ont/geosparql#" xmlns:locn="http://www.w3.org/ns/locn#" xmlns:org="http://www.w3.org/ns/org#" xmlns:owl="http://www.w3.org/2002/07/owl#" xmlns:prov="http://www.w3.org/ns/prov#" xmlns:rdfs="http://www.w3.org/2000/01/rdf-schema#" xmlns:schema="http://schema.org/" xmlns:skos="http://www.w3.org/2004/02/skos/core#" xmlns:vcard="http://www.w3.org/2006/vcard/ns#" xmlns:wdrs="http://www.w3.org/2007/05/powder-s#">
<rdf:type rdf:resource="http://www.w3.org/ns/dcat#Dataset"/>
<dct:type rdf:resource="http://purl.org/dc/dcmitype/Text"/>
<dct:identifier rdf:datatype="http://www.w3.org/2001/XMLSchema#anyURI">https://doi.org/10.5281/zenodo.56002</dct:identifier>
<foaf:page rdf:resource="https://doi.org/10.5281/zenodo.56002"/>
<dct:creator>
<rdf:Description>
<rdf:type rdf:resource="http://xmlns.com/foaf/0.1/Agent"/>
<foaf:name>Bittremieux, Wout</foaf:name>
<foaf:givenName>Wout</foaf:givenName>
<foaf:familyName>Bittremieux</foaf:familyName>
<org:memberOf>
<foaf:Organization>
<foaf:name>University of Antwerp, Antwerp, Belgium</foaf:name>
</foaf:Organization>
</org:memberOf>
</rdf:Description>
</dct:creator>
<dct:creator>
<rdf:Description>
<rdf:type rdf:resource="http://xmlns.com/foaf/0.1/Agent"/>
<foaf:name>Laukens, Kris</foaf:name>
<foaf:givenName>Kris</foaf:givenName>
<foaf:familyName>Laukens</foaf:familyName>
<org:memberOf>
<foaf:Organization>
<foaf:name>University of Antwerp, Antwerp, Belgium</foaf:name>
</foaf:Organization>
</org:memberOf>
</rdf:Description>
</dct:creator>
<dct:title>Precursor-free and fast spectral library search using approximate nearest neighbor techniques</dct:title>
<dct:publisher>
<foaf:Agent>
<foaf:name>Zenodo</foaf:name>
</foaf:Agent>
</dct:publisher>
<dct:issued rdf:datatype="http://www.w3.org/2001/XMLSchema#gYear">2015</dct:issued>
<dct:issued rdf:datatype="http://www.w3.org/2001/XMLSchema#date">2015-12-06</dct:issued>
<owl:sameAs rdf:resource="https://zenodo.org/record/56002"/>
<skos:notation rdf:datatype="http://www.w3.org/2001/XMLSchema#anyURI">https://zenodo.org/record/56002</skos:notation>
<dct:description>&lt;p&gt;&lt;strong&gt;Precursor-free and fast spectral library search using approximate nearest neighbor techniques&lt;/strong&gt;&lt;/p&gt; &lt;p&gt;In a mass-spectrometry proteomics experiments only a minority of spectra can be confidently identified, with several of the unidentified spectra due to unconsidered modifications. We here present a spectral library search engine using an approximate nearest neighbor scheme to perform precursor-free searches, capable of obtaining mass-tolerant spectrum identifications while significantly speeding up the computation time.&lt;/p&gt; &lt;p&gt;&lt;strong&gt;Introduction&lt;/strong&gt;&lt;/p&gt; &lt;p&gt;Generally, fewer than half of all spectra are identified in a mass-spectrometry proteomics experiment. However, recent research has shown that when using a mass-tolerant database search, a large proportion of the unassigned spectra can be identified as modified peptides. [Chick2015] Unfortunately, by opening up the search space in such a fashion, an extremely high number of candidates has to be checked to determine a peptide-spectrum match (PSM) for each spectrum, resulting in an excessive computation time.&lt;/p&gt; &lt;p&gt;On the other hand, instead of sequence database search engines, spectral library search engines can be used to identify spectra as well. Because spectral libraries use previously observed spectra to determine the PSM&amp;#39;s, its advantages are a reduced search space and very effective similarity matching. Here we apply the idea of mass-tolerant peptide-spectrum matching using a spectral library, by using an approximate nearest neighbor technique to quickly and effectively further reduce the increased search space.&lt;/p&gt; &lt;p&gt;&lt;strong&gt;Methods&lt;/strong&gt;&lt;/p&gt; &lt;p&gt;Although spectral libraries by definition exhibit a reduced search space compared to sequence database search engines, when performing a mass-tolerant search, still tens to hundreds of thousands of candidate matches have to be checked, up to almost the entire spectral library, as indicated in Figure 1. However, because when using spectral libraries all library spectra are known beforehand, we can leverage this limited search space to only retrieve the most relevant candidates.&lt;/p&gt; &lt;p&gt;Spectral libraries mostly employ the cosine distance as similarity measure to determine valid matches. Then, each spectrum can be considered as a vector in a (very) high-dimensional space. Generally, for a query spectrum its similarity with all library spectra within the precursor mass window has to be computed. However, by using approximate nearest neighbor techniques in this vector space, the number of candidate matches to be considered can be drastically reduced. Approximate nearest neighbor techniques based on the locality-sensitive hashing principle are able to partition the data into &amp;#39;buckets&amp;#39; consisting of very similar vectors. This is done by iteratively hashing vectors to buckets based on their position compared to random split vectors. This way the data space can be reduced until only a few, very similar, vectors remain in each bucket. Then, for each query spectrum, instead of having to examine the whole data space, only the bucket(s) with the most similar library spectra have to be retrieved to determine the best PSM.&lt;/p&gt; &lt;p&gt;&lt;strong&gt;Results &amp;amp; Discussion&lt;/strong&gt;&lt;/p&gt; &lt;p&gt;We have implemented a mass-tolerant approximate nearest neighbor spectral library search engine in Python. Preliminary results show that approximate nearest neighbor techniques can drastically reduce the search space and speed up queries. Furthermore, this speed-up can be tuned at the expense of some accuracy.&lt;/p&gt; &lt;p&gt;Additionally, because in this approach candidate spectra are nog longer filtered on precursor mass, performing precursor-free, mass-tolerant, searches is implicitly supported. Figure 2 shows that most PSM&amp;#39;s are due to unmodified peptides (a mass difference around 0 Da), while on the other hand, various modified peptides can be identified as well, where based on the precursor mass difference the modification(s) can be determined.&lt;/p&gt; &lt;p&gt;Using approximate nearest neighbor techniques to speed up spectral library search engines seems a promising technique to perform mass-tolerant searches to identify modified peptides, resulting in a record number of spectrum identifications that can be obtained in a minimum amount of time.&lt;/p&gt; &lt;p&gt;&lt;strong&gt;References&lt;/strong&gt;&lt;/p&gt; &lt;p&gt;Chick, J. M. &lt;em&gt;et al&lt;/em&gt;. A mass-tolerant database search identifies a large proportion of unassigned spectra in shotgun proteomics as modified peptides. &lt;em&gt;Nature Biotechnology&lt;/em&gt; &lt;strong&gt;33&lt;/strong&gt;, 743&amp;ndash;749 (2015).&lt;/p&gt;</dct:description>
<dct:accessRights rdf:resource="http://publications.europa.eu/resource/authority/access-right/PUBLIC"/>
<dct:accessRights>
<rdfs:label>Open Access</rdfs:label>
</dct:RightsStatement>
</dct:accessRights>
<dcat:distribution>
<dcat:Distribution>
<dct:rights>
<rdfs:label>Creative Commons Attribution Share Alike 4.0 International</rdfs:label>
</dct:RightsStatement>
</dct:rights>
<dcat:accessURL rdf:resource="https://doi.org/10.5281/zenodo.56002"/>
</dcat:Distribution>
</dcat:distribution>
</rdf:Description>
</rdf:RDF>

21
2
views