{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T00:55:56Z","timestamp":1772240156780,"version":"3.50.1"},"reference-count":37,"publisher":"Frontiers Media SA","license":[{"start":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T00:00:00Z","timestamp":1756684800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["frontiersin.org"],"crossmark-restriction":true},"short-container-title":["Front. Bioinform."],"abstract":"<jats:p>Protein interatomic contacts, defined by spatial proximity and physicochemical complementarity at atomic resolution, are fundamental to characterizing molecular interactions and bonding. Methods for calculating contacts are generally categorized as cutoff-dependent, which rely on Euclidean distances, or cutoff-independent, which utilize Delaunay and Voronoi tessellations. While cutoff-dependent methods are recognized for their simplicity, completeness, and reliability, traditional implementations remain computationally expensive, posing significant scalability challenges in the current Big Data era of bioinformatics. Here, we introduce COC<jats:inline-formula><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"m3\"><mml:mrow><mml:mi>\u03b1<\/mml:mi><\/mml:mrow><\/mml:math><\/jats:inline-formula>DA (COntact search pruning by C<jats:inline-formula><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"m4\"><mml:mrow><mml:mi>\u03b1<\/mml:mi><\/mml:mrow><\/mml:math><\/jats:inline-formula> Distance Analysis), a Python-based command-line tool for improving search pruning in large-scale interatomic protein contact analysis using alpha-carbon (C<jats:inline-formula><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"m5\"><mml:mrow><mml:mi>\u03b1<\/mml:mi><\/mml:mrow><\/mml:math><\/jats:inline-formula>) distance matrices. COC<jats:inline-formula><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"m6\"><mml:mrow><mml:mi>\u03b1<\/mml:mi><\/mml:mrow><\/mml:math><\/jats:inline-formula>DA detects intra- and inter-chain contacts, and classifies them into seven different types: hydrogen and disulfide bonds; hydrophobic effects; attractive, repulsive, and salt-bridge interactions; and aromatic stackings. To evaluate our tool, we compared it with three traditional approaches in the literature: all-against-all atom distance calculation (\u201cbrute-force\u201d), static C<jats:inline-formula><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"m7\"><mml:mrow><mml:mi>\u03b1<\/mml:mi><\/mml:mrow><\/mml:math><\/jats:inline-formula> distance cutoff (SC), and Biopython\u2019s NeighborSearch class (NS). COC<jats:inline-formula><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"m8\"><mml:mrow><mml:mi>\u03b1<\/mml:mi><\/mml:mrow><\/mml:math><\/jats:inline-formula>DA demonstrated superior performance compared to the other methods, achieving on average 6x faster computation times than advanced data structures like <jats:italic>k<\/jats:italic>-d trees from NS, in addition to being simpler to implement and fully customizable. The presented tool facilitates exploratory and large-scale analyses of interatomic contacts in proteins in a simple and efficient manner, also enabling the integration of results with other tools and pipelines. The COC<jats:inline-formula><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"m9\"><mml:mrow><mml:mi>\u03b1<\/mml:mi><\/mml:mrow><\/mml:math><\/jats:inline-formula>DA tool is freely available at <jats:ext-link>https:\/\/github.com\/LBS-UFMG\/COCaDA<\/jats:ext-link>.<\/jats:p>","DOI":"10.3389\/fbinf.2025.1630078","type":"journal-article","created":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T05:33:10Z","timestamp":1756704790000},"update-policy":"https:\/\/doi.org\/10.3389\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["COC\u03b1DA - a fast and scalable algorithm for interatomic contact detection in proteins using C\u03b1 distance matrices"],"prefix":"10.3389","volume":"5","author":[{"given":"Rafael Pereira","family":"Lemos","sequence":"first","affiliation":[]},{"given":"Diego","family":"Mariano","sequence":"additional","affiliation":[]},{"given":"Sabrina De Azevedo","family":"Silveira","sequence":"additional","affiliation":[]},{"given":"Raquel C.","family":"de Melo-Minardi","sequence":"additional","affiliation":[]}],"member":"1965","published-online":{"date-parts":[[2025,9,1]]},"reference":[{"key":"B1","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1038\/s41586-024-07487-w","article-title":"Accurate structure prediction of biomolecular interactions with AlphaFold 3","volume":"630","author":"Abramson","year":"2024","journal-title":"Nature"},{"key":"B2","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1186\/s12859-020-03575-6","article-title":"Proteus: an algorithm for proposing stabilizing mutation pairs based on interactions observed in known protein 3D structures","volume":"21","author":"Barroso","year":"2020","journal-title":"BMC Bioinforma."},{"key":"B3","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1145\/361002.361007","article-title":"Multidimensional binary search trees used for associative searching","volume":"18","author":"Bentley","year":"1975","journal-title":"Commun. ACM"},{"key":"B4","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/978-3-540-77974-2_5","article-title":"Orthogonal range searching","volume-title":"Computational geometry","author":"Berg","year":"2008"},{"key":"B5","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1093\/nar\/28.1.235","article-title":"The protein data bank","volume":"28","author":"Berman","year":"2000","journal-title":"Nucleic Acids Res."},{"key":"B6","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1186\/1471-2105-12-313","article-title":"Comprehensive, atomic-level characterization of structurally characterized protein-protein interactions: the PICCOLO database","volume":"12","author":"Bickerton","year":"2011","journal-title":"BMC Bioinforma."},{"key":"B7","doi-asserted-by":"publisher","first-page":"50","DOI":"10.48550\/arXiv.1410.5420","article-title":"Building a balanced k-d tree in o(kn log n) time","volume":"4","author":"Brown","year":"2015","journal-title":"J. Comput. Graph. Tech. (JCGT)"},{"key":"B8","doi-asserted-by":"publisher","first-page":"R8","DOI":"10.1186\/gb-2006-7-1-r8","article-title":"A gold standard set of mechanistically diverse enzyme superfamilies","volume":"7","author":"Brown","year":"2006","journal-title":"Genome Biol."},{"key":"B9","doi-asserted-by":"publisher","first-page":"1422","DOI":"10.1093\/bioinformatics\/btp163","article-title":"Biopython: freely available python tools for computational molecular biology and bioinformatics","volume":"25","author":"Cock","year":"2009","journal-title":"Bioinformatics"},{"key":"B10","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1002\/prot.22187","article-title":"Protein cutoff scanning: a comparative analysis of cutoff dependent and cutoff free methods for prospecting contacts in proteins","volume":"74","author":"da Silveira","year":"2009","journal-title":"Proteins"},{"key":"B11","first-page":"793","article-title":"Sur la sph\u00e8re vide. \u00c0 la m\u00e9moire de georges vorono\u00ef","volume-title":"Bulletin de l\u2019Acad\u00e9mie des Sciences de l\u2019URSS. Classe des sciences math\u00e9matiques et naturelles VII","author":"Delaunay","year":"1934"},{"key":"B12","doi-asserted-by":"publisher","first-page":"e62","DOI":"10.1002\/cpps.62","article-title":"Computational methods for predicting protein-protein interactions using various protein features","volume":"93","author":"Ding","year":"2018","journal-title":"Curr. Protoc. Protein Sci."},{"key":"B13","doi-asserted-by":"publisher","first-page":"e13099","DOI":"10.7717\/peerj.13099","article-title":"E-Volve: understanding the impact of mutations in SARS-CoV-2 variants spike protein on antibodies and ACE2 affinity through patterns of chemical interactions at protein interfaces","volume":"10","author":"Dos Santos","year":"2022","journal-title":"PeerJ"},{"key":"B14","doi-asserted-by":"publisher","first-page":"1317","DOI":"10.1109\/tcbb.2019.2892099","article-title":"Napoli: a graph-based strategy to detect and visualize conserved protein-ligand interactions in large-scale","volume":"17","author":"Fassio","year":"2020","journal-title":"IEEE\/ACM Trans. Comp. Biol. Bioinf."},{"key":"B15","doi-asserted-by":"publisher","first-page":"4300","DOI":"10.1021\/acs.jcim.2c00695","article-title":"Prioritizing virtual screening with interpretable interaction fingerprints","volume":"62","author":"Fassio","year":"2022","journal-title":"J. Chem. Inf. Model."},{"key":"B16","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/0022-2836(92)90693-e","article-title":"Topology fingerprint approach to the inverse protein folding problem","volume":"227","author":"Godzik","year":"1992","journal-title":"J. Mol. Biol."},{"key":"B17","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/j.jmb.2016.12.004","article-title":"Arpeggio: a web server for calculating and visualising interatomic interactions in protein structures","volume":"429","author":"Jubb","year":"2017","journal-title":"J. Mol. Biol."},{"key":"B18","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1038\/s41586-021-03819-2","article-title":"Highly accurate protein structure prediction with AlphaFold","volume":"596","author":"Jumper","year":"2021","journal-title":"Nature"},{"key":"B19","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1038\/181662a0","article-title":"A three-dimensional model of the myoglobin molecule obtained by x-ray analysis","volume":"181","author":"Kendrew","year":"1958","journal-title":"Nature"},{"key":"B20","doi-asserted-by":"publisher","first-page":"e2315002121","DOI":"10.1073\/pnas.2315002121","article-title":"AlphaFold two years on: validation and impact","volume":"121","author":"Kovalevskiy","year":"2024","journal-title":"Proc. Natl. Acad. Sci. U. S. A."},{"key":"B21","doi-asserted-by":"publisher","first-page":"2778","DOI":"10.1021\/ci200227u","article-title":"LigPlot+: multiple ligand-protein interaction diagrams for drug discovery","volume":"51","author":"Laskowski","year":"2011","journal-title":"J. Chem. Inf. Model."},{"key":"B22","doi-asserted-by":"publisher","first-page":"2145","DOI":"10.1093\/bioinformatics\/bth203","article-title":"STING contacts: a web-based application for identification and analysis of amino acid contacts within protein structure and across protein interfaces","volume":"20","author":"Mancini","year":"2004","journal-title":"Bioinformatics"},{"key":"B23","doi-asserted-by":"publisher","first-page":"1246859","DOI":"10.3389\/fbinf.2023.1246859","article-title":"Editorial: bioinformatics in the age of data science: algorithms, methods, and tools applied from omics to structural data","volume":"3","author":"Mariano","year":"2023","journal-title":"Front. Bioinforma."},{"key":"B24","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.sbi.2018.09.003","article-title":"Structural biology meets data science: does anything change?","volume":"52","author":"Mura","year":"2018","journal-title":"Curr. Opin. Struct. Biol."},{"key":"B25","doi-asserted-by":"publisher","first-page":"100869","DOI":"10.1016\/j.genrep.2020.100869","article-title":"Big data in biology: the hope and present-day challenges in it","volume":"21","author":"Pal","year":"2020","journal-title":"Gene Rep."},{"key":"B26","doi-asserted-by":"publisher","first-page":"730350","DOI":"10.3389\/fbinf.2021.730350","article-title":"VTR: a web tool for identifying analogous contacts on protein structures and their complexes","volume":"1","author":"Pimentel","year":"2021","journal-title":"F. Bioinf."},{"key":"B27","doi-asserted-by":"publisher","first-page":"S12","DOI":"10.1186\/1471-2164-12-S4-S12","article-title":"Cutoff scanning matrix: structural classification and function prediction by protein inter-residue distance patterns","volume":"12","author":"Pires","year":"2011","journal-title":"BMC Gen."},{"key":"B28","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1111\/j.1747-0285.2008.00762.x","article-title":"CREDO: a protein-ligand interaction database for drug discovery","volume":"73","author":"Schreyer","year":"2009","journal-title":"Chem. Biol. Drug Des."},{"key":"B29","doi-asserted-by":"publisher","first-page":"bat049","DOI":"10.1093\/database\/bat049","article-title":"CREDO: a structural interactomics database for drug discovery","volume":"2013","author":"Schreyer","year":"2013","journal-title":"Database (Oxford)"},{"key":"B30","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.entcom.2018.11.001","article-title":"Proteingo: motivation, user experience, and learning of molecular interactions in biological complexes","volume":"29","author":"Silva","year":"2019","journal-title":"Entertain. Comput."},{"key":"B31","first-page":"1","article-title":"Principles of protein structure and function","volume-title":"Intro. to biomol. Struct. and biophys.","author":"Smetana","year":"2017"},{"key":"B32","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1093\/bioinformatics\/15.4.327","article-title":"Automated analysis of interatomic contacts in proteins","volume":"15","author":"Sobolev","year":"1999","journal-title":"Bioinformatics"},{"key":"B33","doi-asserted-by":"publisher","first-page":"e07454","DOI":"10.7554\/elife.07454","article-title":"Contacts-based prediction of binding affinity in protein-protein complexes","volume":"4","author":"Vangone","year":"2015","journal-title":"Elife"},{"key":"B34","doi-asserted-by":"publisher","first-page":"D368","DOI":"10.1093\/nar\/gkad1011","article-title":"AlphaFold protein structure database in 2024: providing structure coverage for over 214 million protein sequences","volume":"52","author":"Varadi","year":"2024","journal-title":"Nucleic Acids Res."},{"key":"B35","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1515\/crll.1908.133.97","article-title":"Nouvelles applications des param\u00e8tres continus \u00e0 la th\u00e9orie des formes quadratiques. deuxi\u00e8me m\u00e9moire. recherches sur les parall\u00e9llo\u00e8dres primitifs","volume":"134","author":"Voronoi","year":"1908","journal-title":"J. f\u00fcr die reine und angewandte Math."},{"key":"B36","doi-asserted-by":"crossref","DOI":"10.1109\/RT.2006.280216","article-title":"On building fast kd-trees for ray tracing, and on doing that in O(N log n)","volume-title":"2006 IEEE symposium on interactive ray tracing","author":"Wald","year":"2006"},{"key":"B37","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1093\/protein\/8.2.127","article-title":"LIGPLOT: a program to generate schematic diagrams of protein-ligand interactions","volume":"8","author":"Wallace","year":"1995","journal-title":"Protein Eng. Des. Sel."}],"container-title":["Frontiers in Bioinformatics"],"original-title":[],"link":[{"URL":"https:\/\/www.frontiersin.org\/articles\/10.3389\/fbinf.2025.1630078\/full","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T05:33:12Z","timestamp":1756704792000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.frontiersin.org\/articles\/10.3389\/fbinf.2025.1630078\/full"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,1]]},"references-count":37,"alternative-id":["10.3389\/fbinf.2025.1630078"],"URL":"https:\/\/doi.org\/10.3389\/fbinf.2025.1630078","relation":{},"ISSN":["2673-7647"],"issn-type":[{"value":"2673-7647","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,1]]},"article-number":"1630078"}}