Full text
33,705 characters
· extracted from
preprint-html
· click to expand
AlphaFind: Discover structure similarity across the entire known proteome | bioRxiv /* */ /* */ <!-- <!-- /*! * yepnope1.5.4 * (c) WTFPL, GPLv2 */ (function(a,b,c){function d(a){return"[object Function]"==o.call(a)}function e(a){return"string"==typeof a}function f(){}function g(a){return!a||"loaded"==a||"complete"==a||"uninitialized"==a}function h(){var a=p.shift();q=1,a?a.t?m(function(){("c"==a.t?B.injectCss:B.injectJs)(a.s,0,a.a,a.x,a.e,1)},0):(a(),h()):q=0}function i(a,c,d,e,f,i,j){function k(b){if(!o&&g(l.readyState)&&(u.r=o=1,!q&&h(),l.onload=l.onreadystatechange=null,b)){"img"!=a&&m(function(){t.removeChild(l)},50);for(var d in y[c])y[c].hasOwnProperty(d)&&y[c][d].onload()}}var j=j||B.errorTimeout,l=b.createElement(a),o=0,r=0,u={t:d,s:c,e:f,a:i,x:j};1===y[c]&&(r=1,y[c]=[]),"object"==a?l.data=c:(l.src=c,l.type=a),l.width=l.height="0",l.onerror=l.onload=l.onreadystatechange=function(){k.call(this,r)},p.splice(e,0,u),"img"!=a&&(r||2===y[c]?(t.insertBefore(l,s?null:n),m(k,j)):y[c].push(l))}function j(a,b,c,d,f){return q=0,b=b||"j",e(a)?i("c"==b?v:u,a,b,this.i++,c,d,f):(p.splice(this.i++,0,a),1==p.length&&h()),this}function k(){var a=B;return a.loader={load:j,i:0},a}var l=b.documentElement,m=a.setTimeout,n=b.getElementsByTagName("script")[0],o={}.toString,p=[],q=0,r="MozAppearance"in l.style,s=r&&!!b.createRange().compareNode,t=s?l:n.parentNode,l=a.opera&&"[object Opera]"==o.call(a.opera),l=!!b.attachEvent&&!l,u=r?"object":l?"script":"img",v=l?"script":u,w=Array.isArray||function(a){return"[object Array]"==o.call(a)},x=[],y={},z={timeout:function(a,b){return b.length&&(a.timeout=b[0]),a}},A,B;B=function(a){function b(a){var a=a.split("!"),b=x.length,c=a.pop(),d=a.length,c={url:c,origUrl:c,prefixes:a},e,f,g;for(f=0;f<d;f++)g=a[f].split("="),(e=z[g.shift()])&&(c=e(c,g));for(f=0;f<b;f++)c=x[f](c);return c}function g(a,e,f,g,h){var i=b(a),j=i.autoCallback;i.url.split(".").pop().split("?").shift(),i.bypass||(e&&(e=d(e)?e:e[a]||e[g]||e[a.split("/").pop().split("?")[0]]),i.instead?i.instead(a,e,f,g,h):(y[i.url]?i.noexec=!0:y[i.url]=1,f.load(i.url,i.forceCSS||!i.forceJS&&"css"==i.url.split(".").pop().split("?").shift()?"c":c,i.noexec,i.attrs,i.timeout),(d(e)||d(j))&&f.load(function(){k(),e&&e(i.origUrl,h,g),j&&j(i.origUrl,h,g),y[i.url]=2})))}function h(a,b){function c(a,c){if(a){if(e(a))c||(j=function(){var a=[].slice.call(arguments);k.apply(this,a),l()}),g(a,j,b,0,h);else if(Object(a)===a)for(n in m=function(){var b=0,c;for(c in a)a.hasOwnProperty(c)&&b++;return b}(),a)a.hasOwnProperty(n)&&(!c&&!--m&&(d(j)?j=function(){var a=[].slice.call(arguments);k.apply(this,a),l()}:j[n]=function(a){return function(){var b=[].slice.call(arguments);a&&a.apply(this,b),l()}}(k[n])),g(a[n],j,b,n,h))}else!c&&l()}var h=!!a.test,i=a.load||a.both,j=a.callback||f,k=j,l=a.complete||f,m,n;c(h?a.yep:a.nope,!!i),i&&c(i)}var i,j,l=this.yepnope.loader;if(e(a))g(a,0,l,0);else if(w(a))for(i=0;i (function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start':new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0];var j=d.createElement(s);var dl=l!='dataLayer'?'&l='+l:'';j.src='//www.googletagmanager.com/gtm.js?id='+i+dl;j.type='text/javascript';j.async=true;f.parentNode.insertBefore(j,f);})(window,document,'script','dataLayer','GTM-M677548'); Skip to main content Home About Submit ALERTS / RSS Search for this keyword Advanced Search New Results AlphaFind: Discover structure similarity across the entire known proteome View ORCID Profile David Procházka , View ORCID Profile Terézia Slanináková , View ORCID Profile Jaroslav Olha , View ORCID Profile Adrián Rošinec , View ORCID Profile Katarína Grešová , Miriama Jánošová , View ORCID Profile Jakub Čillík , View ORCID Profile Jana Porubská , View ORCID Profile Radka Svobodová , View ORCID Profile Vlastislav Dohnal , View ORCID Profile Matej Antol doi: https://doi.org/10.1101/2024.02.15.580465 David Procházka 1 Faculty of Informatics, Masaryk University , Brno, 602 00, Czech Republic Find this author on Google Scholar Find this author on PubMed Search for this author on this site ORCID record for David Procházka Terézia Slanináková 1 Faculty of Informatics, Masaryk University , Brno, 602 00, Czech Republic 4 Institute of Computer Science, Masaryk University , Brno, 602 00, Czech Republic Find this author on Google Scholar Find this author on PubMed Search for this author on this site ORCID record for Terézia Slanináková Jaroslav Olha 1 Faculty of Informatics, Masaryk University , Brno, 602 00, Czech Republic 4 Institute of Computer Science, Masaryk University , Brno, 602 00, Czech Republic Find this author on Google Scholar Find this author on PubMed Search for this author on this site ORCID record for Jaroslav Olha Adrián Rošinec 2 Biological Data Management and Analysis Core Facility, CEITEC – Central European Institute of Technology, Masaryk University , Brno, 625 00, Czech Republic 3 National Centre for Biomolecular Research, Faculty of Science, Masaryk University , Brno, 625 00, Czech Republic 4 Institute of Computer Science, Masaryk University , Brno, 602 00, Czech Republic Find this author on Google Scholar Find this author on PubMed Search for this author on this site ORCID record for Adrián Rošinec Katarína Grešová 3 National Centre for Biomolecular Research, Faculty of Science, Masaryk University , Brno, 625 00, Czech Republic Find this author on Google Scholar Find this author on PubMed Search for this author on this site ORCID record for Katarína Grešová Miriama Jánošová 1 Faculty of Informatics, Masaryk University , Brno, 602 00, Czech Republic Find this author on Google Scholar Find this author on PubMed Search for this author on this site Jakub Čillík 4 Institute of Computer Science, Masaryk University , Brno, 602 00, Czech Republic Find this author on Google Scholar Find this author on PubMed Search for this author on this site ORCID record for Jakub Čillík Jana Porubská 3 National Centre for Biomolecular Research, Faculty of Science, Masaryk University , Brno, 625 00, Czech Republic Find this author on Google Scholar Find this author on PubMed Search for this author on this site ORCID record for Jana Porubská Radka Svobodová 2 Biological Data Management and Analysis Core Facility, CEITEC – Central European Institute of Technology, Masaryk University , Brno, 625 00, Czech Republic Find this author on Google Scholar Find this author on PubMed Search for this author on this site ORCID record for Radka Svobodová Vlastislav Dohnal 1 Faculty of Informatics, Masaryk University , Brno, 602 00, Czech Republic Find this author on Google Scholar Find this author on PubMed Search for this author on this site ORCID record for Vlastislav Dohnal For correspondence: dohnal{at}fi.muni.cz antol{at}muni.cz Matej Antol 1 Faculty of Informatics, Masaryk University , Brno, 602 00, Czech Republic 4 Institute of Computer Science, Masaryk University , Brno, 602 00, Czech Republic Find this author on Google Scholar Find this author on PubMed Search for this author on this site ORCID record for Matej Antol For correspondence: dohnal{at}fi.muni.cz antol{at}muni.cz Abstract Full Text Info/History Metrics Data/Code Preview PDF ABSTRACT AlphaFind is a web-based search engine that provides fast structure-based retrieval in the entire set of AlphaFold DB structures. Unlike other protein processing tools, AlphaFind is focused entirely on tertiary structure, automatically extracting the main 3D features of each protein chain and using a machine learning model to find the most similar structures. This indexing approach and the 3D feature extraction method used by AlphaFind have both demonstrated remarkable scalability to large datasets as well as to large protein structures. The web application itself has been designed with a focus on clarity and ease of use. The searcher accepts any valid Uniprot ID, PDB ID or gene symbol as input, and returns a set of similar protein chains from AlphaFold DB, including various similarity metrics between the query and each of the retrieved results. In addition to the main search functionality, the application provides 3D visualizations of protein structure superpositions in order to allow researchers to instantly analyze the structural similarity of the retrieved results. The AlphaFind web application is available online for free and without any registration at https://alphafind.fi.muni.cz . Download figure Open in new tab INTRODUCTION Protein structural data are highly beneficial scientific resources that serve as the basis for ever-growing and valuable research. Thanks to seven decades of intensive research, we currently have more than 200 thousand experimental protein 3D structures deposited in the Protein Data Bank (PDB) ( 1 ). Furthermore, the AlphaFold algorithm ( 2 ), trained on these experimental data, produces highly reliable protein 3D structure predictions. As a result, the AlphaFold database has been published ( 3 ), containing more than 200 million 3D protein structures. In parallel, other databases of predicted protein 3D structures have been published, such as ESM Metagenomic Atlas ( 4 ), collecting 600 million protein 3D structures. Various research fields in bioinformatics benefit from such databases, with new cutting-edge technology on the horizon ( 5 ). To take full advantage of this enormous amount of data, it is essential to organize them efficiently. Specifically, it is necessary to perform a structure-based search, because structural similarities frequently imply functional correspondence, even without high sequence similarity. Unfortunately, convetional protein structure tools (e.g., PDBeFold) are not able to handle such huge datasets. To address this issue, novel searching tools have been developed, e.g., FoldSeek ( 6 ), 3D-surfer ( 7 )or Dali server ( 8 ).However their functionality has some substantial limitations: they cannot search through the whole AlphaFold DB, and they rely on predefined fold patterns. For this reason, we developed AlphaFind, a protein search application that is focused entirely on tertiary structure, automatically extracting the main 3D features of each protein chain and using a machine learning model to find the most similar structures. Therefore, it is not limited by the occurrence of specific fold patterns. AlphaFind takes advantage of the Learned Metric Index approach ( 9 ) as well as a 3D feature extraction method designed for protein structures ( 10 ),both of which have demonstrated remarkable scalability to large datasets and to large protein structures. The AlphaFind web application has been designed with a focus on clarity and ease of use, with links to AlphaFold DB provided for additional information wherever appropriate. The search accepts any valid Uniprot ID or PDB ID as input and returns a set of similar protein chains from AlphaFold DB, including various similarity metrics between the query and each of the retrieved results. Beyond the primary search functionality, the application provides 3D visualizations of protein structure superpositions, and allows researchers to instantly analyze the structural similarity of the retrieved results. DESCRIPTION OF THE WEB SERVER The application is available as an online service free of charge. It is composed of two integral components – a front end and a back end. The front end is accessible via an internet browser, communicating with the back end that evaluates queries and returns results back to the front end. The back end starts with an offline phase, where it pre-processes the data and creates a search index for rapid search request evaluation in the online phase. Protein structure representation We utilize the compact data embedding method described in ( 10 ) in conjunction with data clustering and machine learning. This approach captures the semantic relationships between protein structures and quickly identifies the most relevant groups of data for a given query. The embedding of a protein is essentially an extremely compressed representation of its 3D structure, which only accounts for the broad structural features of the whole structure while neglecting primary or secondary structure information. Data preparation/indexation In the offline phase, we first extract semantic information from raw cif files into vector embeddings, thereby compressing the original AlphaFold DB size from ∼ 23 TiB into ∼ 20 GiB and obtaining representation that is more suitable for data processing algorithms. Then, we build an index on the embeddings using a learned indexing approach. Learned indexes form a new research stream defined by Kraska et al. for one-dimensional numeric data ( 11 ).This research direction was later expanded to the domain of complex data where data items are compared using a distance function. The distance expresses complex similarity beyond mere comparison of two integers, as shown in ( 9 , 12 ). The latter two methods in conjunction with ( 10 ) establish the basis of the indexing solution presented in here. Workflow AlphaFind was developed to provide an intuitive and useful interface for discovering structurally similar proteins within AlphaFold DB. The workflow, as depicted in Figure 1 , was optimized and tested for maximum computational efficiency to provide fast and accurate results. The following steps take place from the moment that the user poses a query: Download figure Open in new tab Figure 1. Visual representation of AlphaFind’s workflow. Translating the input into a UniProt ID : AlphaFind supports three forms of input: UniProt ID, PBD ID, and Gene symbol. Since UniProt ID is internally used to identify a protein, other forms of input must be translated into UniProt ID using publicly available APIs. For PDB ID to UniProt ID conversion, we use: https://www.ebi.ac.uk/pdbe/api/mappings/uniprot/ and Gene symbol to UniProt ID conversion AlphaFind relies on: https://rest.uniprot.org/idmapping . Searching for a set of candidate proteins : using the UniProt ID, the server finds the associated protein structure embedding created during data preparation. This embedding is served to the index (a fully connected neural network), which returns the top ten most similar clusters to the embedding, narrowing down the set of candidates from 214 to ∼ 10 million. Then, Euclidean distance is evaluated between the input and each candidate object embedding ( 13 ). We sort such candidates by this proximity and take just 1000 closest proteins, which reduces the search space even further. Evaluating global and local similarity: Based on the desired result set size ( n = 50, initially), the nearest n proteins out of the candidate set are selected to evaluate local ( RMSD ) and global ( TM-Score ) similarity, together with aligned residues and sequence identity , using the US-align tool ( 14 ). This is the most time-intensive step of the search process, taking up to several tens of seconds. Downloading metadata for query and results : After collecting the search results, AlphaFind uses the AlphaFold DB’s API to collect useful information, such as the name of the protein structure, the host organism name, and groups the results by organism name for easier orientation. Visualizing protein structures’ overlap: To represent the protein structure similarity visually, AlphaFind utilizes NGL Viewer ( 15 ) to display an overlay of every pair of the input protein and a result protein. Additionally, for a more detailed view, each result points to the Mol* Viewer ( 16 ). Showing more results: The user has the option to expand the search results by additional candidate proteins identified in Step 2: they can choose to display 50, 100, 200, or 300 more. If this option is selected, Steps 3-5 repeat, and the result table is updated. Downloading the results: Once searching is finished, the user can download the results for future use or archival in the CSV format using “Export all to CSV” button. To reduce response times, once Steps 2 and 3 are executed for a given input protein, the web server stores the computed results, causing a significant reduction in subsequent waiting times when searching for the same protein. Implementation The front end was implemented in TypeScript using the React framework ( https://reactjs.org/ ) and the Bootstrap library ( https://getbootstrap.com/ ). The back end is written in Python 3.10 with Flask ( https://flask.palletsprojects.com/ ). We tested AlphaFind on a diverse set of proteins varying in size, complexity, and quality. AlphaFind provided biologically relevant results even for small, large and lower quality structures. When AlphaFind did not offer structures with high TM-scores, the results remained biologically relevant. A performance of AlphaFind showed as scalable. Limitations AlphaFind is constructed on AlphaFold DB in version 3, predating the v4 update. The application returns up to 1000 similar protein structures to a single query. The results returned by AlphaFind are approximate, and as such, they may not necessarily contain all the most structurally similar proteins present in AlphaFold DB. Approximate searching trades off resource demands (such as hardware, time and money) for precision. It is customary in complex data management, as the “objective answer”, e.g., which protein structure is more similar to another, does not have an indisputable answer in the first place. Moreover, the design of the application allows for loading additional data, which expands and also refines the prior search answer. This functionality enables the user to find protein structures, which could have been missed in the previously shown search results. AlphaFind processes the entire protein structure – its helices, sheets and its unstructured regions – and handles them with equal weight. Therefore, high occurrence of unstructured regions in the input structure can bias the search. This phenomenon is more prevalent in coiled-coil structures but can be also observed in some small structures. RESULTS AND DISCUSSION Searching characteristics Due to the data embedding method used, AlphaFind is mainly concerned with global structural similarity, always comparing the entire structure and treating all parts with equal weight, regardless of primary or secondary structure. Unlike established searching methods, which tend to place more focus on occurrence of certain folds or high local similarity in particular regions, AlphaFind is more likely to find structural similarity across organisms where these regions are less conserved. AlphaFind indexes the entire AlphaFold DB, which contains 214 million protein structures. The conversion to embeddings allows the application to search the database and return the first 50 results in an average of 7 seconds with negligible back-end load. The user can expand the obtained results in increments of 50, 100, 200, and 300, which takes, on average, additional 7, 9, 11, and 15 seconds, respectively. During periods of high load, the users’ requests may be queued and processed with a slight delay, increasing with the number of concurrent users that interact with the application. To demonstrate AlphaFind in practice, we provide three use cases of search and consequent analysis of the returned results. Hemoglobin is a protein that facilitates the transport of oxygen and other gases in red blood cells. Almost all vertebrates contain hemoglobin. It consists of four protein subunits (globins), and is one of the first proteins whose 3D structure has been experimentally determined. There are many types of hemoglobin, with hemoglobin Alpha 1 (encoded by the HBA1 gene) occurring in humans and being the main form of hemoglobin in adults. Here, AlphaFind shows us ( Figure 2 ) that highly similar hemoglobin structures can also be found in other species. Download figure Open in new tab Figure 2. Hemoglobin alpha 1 from Homo sapiens (UniProt ID: I1VZV6) in yellow. Examples of AlphaFind search results: Alpha-globin from Mus musculus (UniProt ID: Q61287) in blue, Hemoglobin subunit beta-like from Esox lucius (UniProt ID: A0A3P8Z522) in green, Hemoglobin alpha A subunit from Anas georgica (UniProt ID: B9VY01) in red. Cytochrome P450 are enzymes which are important for the metabolism of many endogenous compounds and xenobiotics. P450 enzymes have been identified across all biological kingdoms: animals, plants, fungi, bacteria and archaea, as well as in viruses. Cytochrome P450 proteins contain one chain which is composed of more than 20 sheets and helices. Their sequence similarity is very low. In this use case, we can observe similarities among cytochrome P450 structures from various species ( Figure 3 ). The search starts with a cytochrome from corn ( Zea Mays ), and within the first 50 hits, we find similar structures originating from various animals (fish, eagle, mouse, cat, horse, etc.). Download figure Open in new tab Figure 3. Cytochrome P450 family 76 subfamily C polypeptide 7 from Zea mays (UniProt ID: A0A1D6JW22) in yellow. Examples of AlphaFind search results: Uncharacterized protein from Oreochromis niloticus (UniProt ID: A0A669CAC6) in blue, Cytochrome P450 2C19 from Equus caballus (UniProt ID: A0A3Q2H4N0) in green, Cytochrome P450 2H1 from Haliaeetus albicilla (UniProt ID: A0A091PH09) in red. The PIN proteins are transmembrane proteins which regulate plant growth by influencing auxin transport from the cytosol to the extracellular space. They only occur in plants and feature a configuration of 10 main helices that collectively form a pore. Eight types of PIN proteins are known (PIN1-PIN8), and recently, the structures of three PIN proteins were uncovered and published in Nature. The structure of the PIN5 protein differs from other PINs ( 17 ) and has not yet been experimentally determined. This use case shows ( Figure 4 ) that the PIN5 protein structure is strongly conserved among many different plant species. Download figure Open in new tab Figure 4. Auxin efflux carrier component 5 from Arabidopsis thaliana (UniProt ID: Q9FFD0) in yellow. Examples of AlphaFind search results: Auxin efflux carrier component from Citrus unshiu (UniProt ID: A0A2H5NWV3) in blue, uncharacterized protein from Eucalyptus grandis (UniProt ID: A0A059BG64) in green, Auxin efflux carrier component from Vitis vinifera (UniProt ID: A0A438CTF0) in red. CONCLUSION In this article, we presented AlphaFind, a novel web application for fast structure-based search of similar proteins in AlphaFold DB and PDB. AlphaFind utilises the Learned Metric Index approach and a 3D feature extraction method designed for protein structures. The web application presents the search results as a table, sortable according various criteria, i.e., TM-score, RMSD, and the number of aligned residues. The users can also download the results as a CSV file or visualize superpositions of input and output proteins via NGL Viewer. AlphaFind is easy to use and is platform-independent. Documentation describing its usage is referenced on the web page https://alphafind.fi.muni.cz . DATA AVAILABILITY AlphaFind application is available at no cost and no registration at https://alphafind.fi.muni.cz . The user manual is referenced in the application and is also directly available at https://github.com/Coda-Research-Group/AlphaFind/wiki/Manual . The application’s source code is accessible under the MIT license at https://github.com/Coda-Research-Group/AlphaFind and is also available in the Supplementary Data. The LMI is published and its performance reproducibly examined in ( 18 ). The embeddings and weights for the LMI model are available in the Czech National Repository’s pilot at https://doi.org/10.48700/datst.d35zf-1ja47 . SUPPLEMENTARY DATA Supplementary data are available at NAR Online. FUNDING The authors at the Faculty of Informatics, Masaryk University, were supported by Czech Science Foundation [GF23-07040K]. The authors from the Core Facility Biological Data Management and Analysis of CEITEC, Masaryk University, were supported by the Ministry of Education, Youth and Sports of the Czech Republic [LM2023055]. Computational resources were provided by the e-INFRA CZ project, supported by the Ministry of Education, Youth and Sports of the Czech Republic [ID:90254]. Funding for open access charge: Masaryk University as per its Read and Publish agreement with the Oxford University Press. Conflict of interest statement None declared. ACKNOWLEDGEMENTS The authors would like to thank Lucie Novotná for her help with the protein embeddings, Lukáš Hejtmánek for his work on the container infrastructure, and Vladimír Míč and Tomáš Raček for consultation during the early stages of our involvement with the protein structure data. Footnotes https://alphafind.fi.muni.cz/ REFERENCES 1. ↵ Burley , S.K. , Bhikadiya , C. , Bi , C. , Sebastian , B. , Chao , H. , Chen , Li. , Craig , P.A. , Crichlow , G.V. , Dalenberg , K. , Duarte , J.M. et al. ( 2023 ) RCSB Protein Data Bank ( RCSB.org ): delivery of experimentally-determined PDB structures alongside one million computed structure models of proteins from artificial intelligence/machine learning . Nucleic Acids Res ., 51 , D488 – D508 . [ doi: 10.1093/nar/gkac1077 ]. OpenUrl CrossRef PubMed 2. ↵ Jumper , J. , Evans , R. , Pritzel , A. , Green , T. , Figurnov , M. , Ronneberger , O. , Tunyasuvunakool , K. , Bates , R. , žídek , A. , Potapenko , A. et al. ( 2021 ) Applying and improving AlphaFold at CASP14 . Proteins: Structure, Function, and Bioinformatics , 89 , 1711 – 1721 . [ doi: 10.1002/prot.26257 ]. OpenUrl CrossRef PubMed 3. ↵ Varadi , M. , Anyango , S. , Deshpande , M. , Nair , S. , Natassia , C. , Yordanova , G. , Yuan , D. , Stroe , O. , Wood , G. , Laydon , A. et al. ( 2021 ) AlphaFold Protein Structure Database: massively expanding the structural coverage of protein-sequence space with high-accuracy models . Nucleic Acids Res ., 50 , D439 – D444 . [ doi: 10.1093/nar/gkab1061 ]. OpenUrl CrossRef PubMed 4. ↵ Lin , Z. , Akin , H. , Rao , R. , Hie , B. , Zhu , Z. , Lu , W. , Smetanin , N. , Verkuil , R. , Kabeli , O. , Shmueli , Y. et al. ( 2023 ) Evolutionary-scale prediction of atomic-level protein structure with a language model . Science , 379 , 1123 – 1130 . [ doi: 10.1126/science.ade2574 ]. OpenUrl CrossRef PubMed 5. ↵ Varadi , M. and Velankar , S. ( 2023 ) The impact of AlphaFold Protein Structure Database on the fields of life sciences . Proteomics , 23 , 2200128 . [ doi: 10.1002/pmic.202200128 ]. OpenUrl CrossRef 6. ↵ van Kempen , M. , Kim , S.S. , Tumescheit , C. , Mirdita , M. , Gilchrist , C.L.M. , Söding , J. and Steinegger , M. ( 2023 ) Fast and accurate protein structure search with Foldseek . Nat. Biotechnol .. [ doi: 10.1038/s41587-023-01773-0 ]. OpenUrl CrossRef PubMed 7. ↵ La , D. , Esquivel-Rodríguez , J. , Venkatraman , V. , Li , B. , Sael , L. , Ueng , S. , Ahrendt , S. and Kihara , D. ( 2009 ) 3D-SURFER: software for high- throughput protein surface comparison and analysis . Bioinformatics , 25 , 2843 – 2844 . [ doi: 10.1093/bioinformatics/btp542 ]. OpenUrl CrossRef PubMed Web of Science 8. ↵ Holm , L. ( 2022 ) Dali server: structural unification of protein families . Nucleic Acids Res ., 50 , W210 – W215 . [ doi: 10.1093/nar/gkac387 ]. OpenUrl CrossRef PubMed 9. ↵ Antol , M. , Ol’ha , J. , Slanináková , T. and Dohnal , V. ( 2021 ) Learned metric index—proposition of learned indexing for unstructured data . Information Systems , 100 , 101774 . [ doi: 10.1016/j.is.2021.101774 ]. OpenUrl CrossRef 10. ↵ In Skopal , T. , Falchi , F. , Lokoč , J. , Sapino , M.L. , Bartolini , I. and Patella , M. Olha , J. , Slanináková , T. , Gendiar , M. , Antol , M. and Dohnal , V. ( 2022 ) Learned Indexing in Proteins: Substituting Complex Distance Calculations with Embedding and Clustering Techniques . In Skopal , T. , Falchi , F. , Lokoč , J. , Sapino , M.L. , Bartolini , I. and Patella , M. (eds), Similarity Search and Applications , Springer International Publishing, Cham , pp. 274 – 282 . [ doi: 10.1007/978-3-031-17849-822 ]. OpenUrl CrossRef 11. ↵ Kraska , T. , Beutel , A. , Chi , E.H. , Dean , J. and Polyzotis , N. ( 2018 ) The case for learned index structures . In Proceedings of the 2018 International Conference on Management of Data, Association for Computing Machinery , New York, NY, USA , pp. 489 – 504 . [ doi: 10.1145/3183713.3196909 ]. OpenUrl CrossRef 12. ↵ In Reyes , N. , Connor , R. , Kriege , N. , Kazempour , D. , Bartolini , I. , Schubert , E. and Chen , J. Slanináková , T. , Antol , M. , Olha , J. , Kaňa , V. and Dohnal , V. ( 2021 ) Data- driven learned metric index: an unsupervised approach . In Reyes , N. , Connor , R. , Kriege , N. , Kazempour , D. , Bartolini , I. , Schubert , E. and Chen , J. (eds), Similarity Search and Applications , Springer International Publishing, Cham , pp. 81 – 94 . [ doi: 10.1007/978-3-030-89657-77 ]. OpenUrl CrossRef 13. ↵ Johnson , J. , Douze , M. and Jégou , H. ( 2019 ) Billion-scale similarity search with GPUs . IEEE Transactions on Big Data , 7 , 535 – 547 . [ doi: 10.1109/TBDATA.2019.2921572 ]. OpenUrl CrossRef 14. ↵ Zhang , C. , Shine , M. , Pyle , A.M. and Zhang , Y. ( 2022 ) US-align: universal structure alignments of proteins, nucleic acids, and macromolecular complexes . Nat. Methods , 19 , 1109 – 1115 . [ doi: 10.1038/s41592-022-01585-1 ]. OpenUrl CrossRef PubMed 15. ↵ Rose , A.S. and Hildebrand , P.W. ( 2015 ) NGL Viewer: a web application for molecular visualization . Nucleic Acids Res ., 43 , W576 – W579 . [ doi: 10.1093/nar/gkv402 ]. OpenUrl CrossRef PubMed 16. ↵ Sehnal , D. , Bittrich , S. , Deshpande , M. , Svobodová , R. , Berka , K. , Bazgier , V. , Velankar , S. , Burley , S.K. , Koča , J. and Rose , A.S. ( 2021 ) Mol* Viewer: modern web app for 3D visualization and analysis of large biomolecular structure . Nucleic Acids Res ., 49 , W431 – W437 . [ doi: 10.1093/nar/gkab314 ]. OpenUrl CrossRef PubMed 17. ↵ Ung , K.L. , Winkler , M. , Schulz , L. , Kolb , M. , Janacek , D.P. , Dedic , E. , Stokes , D.L. , Hammes , U.Z. and Pedersen , B.P. ( 2022 ) Structures and mechanism of the plant PIN-FORMED auxin transporter . Nature , 609 , 605 – 610 . [ doi: 10.1038/s41586-022-04883-y ]. OpenUrl CrossRef 18. ↵ Slanináková , T. , Antol , M. , Ol’ha , J. , Dohnal ,. V. , Ladra , S. and Martínez-Prieto , M.A. ( 2023 ) Reproducible experiments with Learned Metric Index Framework . Information Systems , 118 , 102255 . [ doi: 10.1016/j.is.2023.102255 ]. OpenUrl CrossRef Back to top Previous Next Posted February 18, 2024. Download PDF Data/Code Email Thank you for your interest in spreading the word about bioRxiv. NOTE: Your email address is requested solely to identify you as the sender of this article. Your Email * Your Name * Send To * Enter multiple addresses on separate lines or separate them with commas. You are going to email the following AlphaFind: Discover structure similarity across the entire known proteome Message Subject (Your Name) has forwarded a page to you from bioRxiv Message Body (Your Name) thought you would like to see this page from the bioRxiv website. Your Personal Message CAPTCHA This question is for testing whether or not you are a human visitor and to prevent automated spam submissions. Share AlphaFind: Discover structure similarity across the entire known proteome David Procházka , Terézia Slanináková , Jaroslav Olha , Adrián Rošinec , Katarína Grešová , Miriama Jánošová , Jakub Čillík , Jana Porubská , Radka Svobodová , Vlastislav Dohnal , Matej Antol bioRxiv 2024.02.15.580465; doi: https://doi.org/10.1101/2024.02.15.580465 Share This Article: Copy Citation Tools AlphaFind: Discover structure similarity across the entire known proteome David Procházka , Terézia Slanináková , Jaroslav Olha , Adrián Rošinec , Katarína Grešová , Miriama Jánošová , Jakub Čillík , Jana Porubská , Radka Svobodová , Vlastislav Dohnal , Matej Antol bioRxiv 2024.02.15.580465; doi: https://doi.org/10.1101/2024.02.15.580465 Citation Manager Formats BibTeX Bookends EasyBib EndNote (tagged) EndNote 8 (xml) Medlars Mendeley Papers RefWorks Tagged Ref Manager RIS Zotero Tweet Widget Facebook Like Google Plus One Subject Area Bioinformatics Subject Areas All Articles Animal Behavior and Cognition (7790) Biochemistry (18177) Bioengineering (14347) Bioinformatics (43052) Biophysics (21935) Cancer Biology (19072) Cell Biology (26128) Clinical Trials (138) Developmental Biology (13630) Ecology (20358) Epidemiology (2067) Evolutionary Biology (24827) Genetics (15833) Genomics (22953) Immunology (18184) Microbiology (41297) Molecular Biology (17508) Neuroscience (90700) Paleontology (679) Pathology (2903) Pharmacology and Toxicology (4941) Physiology (7868) Plant Biology (15476) Scientific Communication and Education (2065) Synthetic Biology (4422) Systems Biology (9996) Zoology (2314) (function(){function c(){var b=a.contentDocument||a.contentWindow.document;if(b){var d=b.createElement('script');d.innerHTML="window.__CF$cv$params={r:'a1afaf712f2525c1',t:'MTc4NDAyMzI3OA=='};var a=document.createElement('script');a.src='/cdn-cgi/challenge-platform/scripts/jsd/main.js';document.getElementsByTagName('head')[0].appendChild(a);";b.getElementsByTagName('head')[0].appendChild(d)}}if(document.body){var a=document.createElement('iframe');a.height=1;a.width=1;a.style.position='absolute';a.style.top=0;a.style.left=0;a.style.border='none';a.style.visibility='hidden';document.body.appendChild(a);if('loading'!==document.readyState)c();else if(window.addEventListener)document.addEventListener('DOMContentLoaded',c);else{var e=document.onreadystatechange||function(){};document.onreadystatechange=function(b){e(b);'loading'!==document.readyState&&(document.onreadystatechange=e,c())}}}})();
Text is read by the "Ask this paper" AI Q&A widget below.
Extraction quality varies by source — PMC NXML preserves structure
cleanly, OA-HTML may include some navigation residue, and OA-PDF can
have broken hyphenation. The publisher copy
(via DOI)
is the canonical version.