{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:44:51Z","timestamp":1773657891605,"version":"3.50.1"},"reference-count":38,"publisher":"Oxford University Press (OUP)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007,1,15]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Summary: Vorolign, a fast and flexible structural alignment method for two or more protein structures is introduced. The method aligns protein structures using double dynamic programming and measures the similarity of two residues based on the evolutionary conservation of their corresponding Voronoi-contacts in the protein structure. This similarity function allows aligning protein structures even in cases where structural flexibilities exist. Multiple structural alignments are generated from a set of pairwise alignments using a consistency-based, progressive multiple alignment strategy.<\/jats:p>\n                  <jats:p>Results: The performance of Vorolign is evaluated for different applications of protein structure comparison, including automatic family detection as well as pairwise and multiple structure alignment. Vorolign accurately detects the correct family, superfamily or fold of a protein with respect to the SCOP classification on a set of difficult target structures. A scan against a database of &amp;gt;4000 proteins takes on average 1 min per target. The performance of Vorolign in calculating pairwise and multiple alignments is found to be comparable with other pairwise and multiple protein structure alignment methods.<\/jats:p>\n                  <jats:p>Availability: Vorolign is freely available for academic users as a web server at<\/jats:p>\n                  <jats:p>Contact: \u00a0fabian.birzele@ifi.lmu.de<\/jats:p>\n                  <jats:p>Supplementary information: Datasets used throughout the article are available at<\/jats:p>","DOI":"10.1093\/bioinformatics\/btl294","type":"journal-article","created":{"date-parts":[[2007,1,19]],"date-time":"2007-01-19T13:51:12Z","timestamp":1169214672000},"page":"e205-e211","source":"Crossref","is-referenced-by-count":47,"title":["Vorolign\u2014fast structural alignment using Voronoi contacts"],"prefix":"10.1093","volume":"23","author":[{"given":"Fabian","family":"Birzele","sequence":"first","affiliation":[{"name":"Practical Informatics and Bioinformatics Group, Department of Informatics, Ludwig-Maximilians-University \u00a0 Amalienstr. 17, D-80333 Munich, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan E.","family":"Gewehr","sequence":"additional","affiliation":[{"name":"Practical Informatics and Bioinformatics Group, Department of Informatics, Ludwig-Maximilians-University \u00a0 Amalienstr. 17, D-80333 Munich, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gergely","family":"Csaba","sequence":"additional","affiliation":[{"name":"Practical Informatics and Bioinformatics Group, Department of Informatics, Ludwig-Maximilians-University \u00a0 Amalienstr. 17, D-80333 Munich, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ralf","family":"Zimmer","sequence":"additional","affiliation":[{"name":"Practical Informatics and Bioinformatics Group, Department of Informatics, Ludwig-Maximilians-University \u00a0 Amalienstr. 17, D-80333 Munich, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2007,1,15]]},"reference":[{"key":"2023041107134861700_","doi-asserted-by":"crossref","first-page":"3389","DOI":"10.1093\/nar\/25.17.3389","article-title":"Gapped BLAST and PSI-BLAST: a new generation of protein database search programs","volume":"25","author":"Altschul","year":"1997","journal-title":"Nucleic Acids Res."},{"key":"2023041107134861700_","doi-asserted-by":"crossref","first-page":"1109","DOI":"10.1093\/protein\/10.10.1109","article-title":"Interchanges of spatially neighbouring residues in structurally conserved environments","volume":"10","author":"Azarya-Sprinzak","year":"1997","journal-title":"Protein Eng."},{"key":"2023041107134861700_","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1145\/235815.235821","article-title":"The Quickhull algorithm for convex hulls","volume":"22","author":"Barber","year":"1996","journal-title":"ACM Trans. Math. Software"},{"key":"2023041107134861700_","doi-asserted-by":"crossref","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":"2023041107134861700_","doi-asserted-by":"crossref","first-page":"4425","DOI":"10.1093\/bioinformatics\/bti712","article-title":"QUASAR-scoring and ranking of sequence\u2013structure alignments","volume":"21","author":"Birzele","year":"2005","journal-title":"Bioinformatics"},{"key":"2023041107134861700_","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1006\/jmbi.2001.4495","article-title":"Pairwise sequence alignment below the twilight zone","volume":"307","author":"Blake","year":"2001","journal-title":"J. Mol. Biol."},{"key":"2023041107134861700_","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1093\/nar\/28.1.254","article-title":"The ASTRAL compendium for protein structure and sequence analysis","volume":"28","author":"Brenner","year":"2000","journal-title":"Nucleic Acids Res."},{"key":"2023041107134861700_","first-page":"345","article-title":"A model of evolutionary change in proteins","volume":"5","author":"Dayhoff","year":"1978","journal-title":"Atlas Prot. Seq. Struct."},{"key":"2023041107134861700_","doi-asserted-by":"crossref","first-page":"7849","DOI":"10.1088\/0305-4470\/30\/22\/022","article-title":"Genetic algorithms for continuous optimization problems\u2013a concept of parameter-space size adjustment","volume":"30","author":"Djurisic","year":"1997","journal-title":"J. Phys. A Math. Gen."},{"key":"2023041107134861700_","doi-asserted-by":"crossref","first-page":"686","DOI":"10.1093\/bioinformatics\/17.8.686","article-title":"Amino acid similarity matrices based on force fields","volume":"17","author":"Dosztanyi","year":"2001","journal-title":"Bioinformatics"},{"key":"2023041107134861700_","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1002\/1097-0134(20010501)43:2<161::AID-PROT1028>3.0.CO;2-F","article-title":"Lattice protein folding with two and four-body statistical potentials","volume":"43","author":"Gan","year":"2001","journal-title":"Proteins"},{"key":"2023041107134861700_","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1006\/jmbi.1993.1489","article-title":"Protein structure comparison by alignment of distance matrices","volume":"233","author":"Holm","year":"1993","journal-title":"J. Mol. Biol."},{"key":"2023041107134861700_","doi-asserted-by":"crossref","first-page":"1865","DOI":"10.1110\/ps.04672604","article-title":"Structural alignment of proteins by a novel TOPOFIT method, as a superimposition of common volumes at a topomax point","volume":"13","author":"Ilyin","year":"2004","journal-title":"Protein Sci."},{"key":"2023041107134861700_","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1002\/nav.3800020109","article-title":"The Hungarian method for the assignment problem","volume":"2","author":"Kuhn","year":"1955","journal-title":"Naval Res. Logist. Quart."},{"key":"2023041107134861700_","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1016\/j.sbi.2005.05.008","article-title":"Structural divergence and distant relationships in proteins: evolution of the globins","volume":"15","author":"Lecomte","year":"2005","journal-title":"Curr. Opin. Struct. Biol."},{"key":"2023041107134861700_","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1093\/bioinformatics\/17.1.63","article-title":"What are the baselines for protein fold recognition?","volume":"17","author":"McGuffin","year":"2001","journal-title":"Bioinformatics"},{"key":"2023041107134861700_","doi-asserted-by":"crossref","first-page":"536","DOI":"10.1016\/S0022-2836(05)80134-2","article-title":"SCOP: a structural classification of proteins database for the investigation of sequences and structures","volume":"247","author":"Murzin","year":"1995","journal-title":"J. Mol. Biol."},{"key":"2023041107134861700_","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/0022-2836(70)90057-4","article-title":"A general method applicable to the search for similarities in the amino acid sequence of two proteins","volume":"48","author":"Needleman","year":"1970","journal-title":"J. Mol. Biol."},{"key":"2023041107134861700_","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1006\/jmbi.2000.4042","article-title":"T-Coffee: a novel method for fast and accurate multiple sequence alignment","volume":"302","author":"Notredame","year":"2000","journal-title":"J. Mol. Biol."},{"key":"2023041107134861700_","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1002\/prot.10553","article-title":"Evaluation of protein fold comparison servers","volume":"54","author":"Novotny","year":"2004","journal-title":"Proteins"},{"key":"2023041107134861700_","doi-asserted-by":"crossref","first-page":"436","DOI":"10.1002\/prot.10587","article-title":"Progressive combinatorial algorithm for multiple structural alignments: application to distantly related proteins","volume":"55","author":"Ochagavia","year":"2004","journal-title":"Proteins"},{"key":"2023041107134861700_","volume-title":"Computational Geometry in C","author":"O'Rourke","year":"1993"},{"key":"2023041107134861700_","first-page":"25","article-title":"An o(n2) algorithm for 3D substructure matching of proteins","volume-title":"Proceedings of the First International Workshop on Shape and Pattern Matching in Computational Biology?","author":"Pennec","year":"1994"},{"key":"2023041107134861700_","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1093\/protein\/13.8.545","article-title":"Structure-derived substitution matrices for alignment of distantly related sequences","volume":"13","author":"Prlic","year":"2000","journal-title":"Protein Eng."},{"key":"2023041107134861700_","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0022-2836(74)90570-1","article-title":"The interpretation of protein structures: total volume, group volume distributions and packing density","volume":"82","author":"Richards","year":"1974","journal-title":"J. Mol. Biol."},{"key":"2023041107134861700_","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1002\/prot.20479","article-title":"Structure alignment via Delaunay tetrahedralization","volume":"60","author":"Roach","year":"2005","journal-title":"Proteins"},{"key":"2023041107134861700_","first-page":"406","article-title":"The neighbor-joining method: a new method for reconstructing phylogenetic trees","volume":"4","author":"Saitou","year":"1987","journal-title":"Mol. Biol. Evol."},{"key":"2023041107134861700_","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1002\/prot.10628","article-title":"A method for simultaneous alignment of multiple protein structures","volume":"56","author":"Shatsky","year":"2004","journal-title":"Proteins"},{"key":"2023041107134861700_","doi-asserted-by":"crossref","first-page":"739","DOI":"10.1093\/protein\/11.9.739","article-title":"Protein structure alignment by incremental combinatorial extension (CE) of the optimal path","volume":"11","author":"Shindyalov","year":"1998","journal-title":"Protein Eng."},{"key":"2023041107134861700_","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0022-2836(89)90084-3","article-title":"Protein structure alignment","volume":"208","author":"Taylor","year":"1989","journal-title":"J. Mol. Biol."},{"key":"2023041107134861700_","doi-asserted-by":"crossref","first-page":"654","DOI":"10.1110\/ps.8.3.654","article-title":"Protein structure comparison using iterated double dynamic programming","volume":"8","author":"Taylor","year":"1999","journal-title":"Protein Sci."},{"key":"2023041107134861700_","doi-asserted-by":"crossref","first-page":"2228","DOI":"10.1093\/bioinformatics\/bth232","article-title":"Arby: automatic protein structure prediction using profile\u2013 profile alignment and confidence measures","volume":"20","author":"von \u00d6hsen","year":"2004","journal-title":"Bioinformatics"},{"key":"2023041107134861700_","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1515\/crll.1908.134.198","article-title":"Nouvelles applications des parametres continus a la theorie des formes quadratiques","volume":"134","author":"Voronoi","year":"1908","journal-title":"J. Reine Angew. Math"},{"key":"2023041107134861700_","doi-asserted-by":"crossref","first-page":"988","DOI":"10.1093\/bioinformatics\/16.11.988","article-title":"Iterative sequence\/secondary structure search for protein homologs: comparison with amino acid sequence alignments and application to fold recognition in genome databases","volume":"16","author":"Wallqvist","year":"2000","journal-title":"Bioinformatics"},{"key":"2023041107134861700_","doi-asserted-by":"crossref","first-page":"II246","DOI":"10.1093\/bioinformatics\/btg1086","article-title":"Flexible structure alignment by chaining aligned fragment pairs allowing twists","volume":"19","author":"Ye","year":"2003","journal-title":"Bioinformatics"},{"key":"2023041107134861700_","doi-asserted-by":"crossref","first-page":"2362","DOI":"10.1093\/bioinformatics\/bti353","article-title":"Multiple flexible structure alignment using partial order graphs","volume":"21","author":"Ye","year":"2005","journal-title":"Bioinformatics"},{"key":"2023041107134861700_","doi-asserted-by":"crossref","first-page":"702","DOI":"10.1002\/prot.20264","article-title":"Scoring function for automated assessment of protein structure template quality","volume":"57","author":"Zhang","year":"2004","journal-title":"Proteins"},{"key":"2023041107134861700_","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1093\/bioinformatics\/14.3.295","article-title":"New scoring schemes for protein fold recognition based on Voronoi contacts","volume":"14","author":"Zimmer","year":"1998","journal-title":"Bioinformatics"}],"container-title":["Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/23\/2\/e205\/49820298\/bioinformatics_23_2_e205.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/23\/2\/e205\/49820298\/bioinformatics_23_2_e205.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,10]],"date-time":"2023-05-10T09:04:05Z","timestamp":1683709445000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article\/23\/2\/e205\/201673"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,1,15]]},"references-count":38,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2007,1,15]]}},"URL":"https:\/\/doi.org\/10.1093\/bioinformatics\/btl294","relation":{"has-review":[{"id-type":"doi","id":"10.3410\/f.1060956.512911","asserted-by":"object"}]},"ISSN":["1367-4811","1367-4803"],"issn-type":[{"value":"1367-4811","type":"electronic"},{"value":"1367-4803","type":"print"}],"subject":[],"published-other":{"date-parts":[[2007,1,15]]},"published":{"date-parts":[[2007,1,15]]}}}