Dynamic Programming Used to Align Protein Structures with a Spectrum is Robust
Overview
Affiliations
Several efficient algorithms to conduct pairwise comparisons among large databases of protein structures have emerged in the recent literature. The central theme is the design of a measure between the Cα atoms of two protein chains, from which dynamic programming is used to compute an alignment. The efficiency and efficacy of these algorithms allows large-scale computational studies that would have been previously impractical. The computational study herein shows that the structural alignment algorithm eigen-decomposition alignment with the spectrum (EIGAs) is robust against both parametric and structural variation.
Petrovskiy D, Nikolsky K, Rudnev V, Kulikova L, Butkova T, Malsagova K Int J Mol Sci. 2023; 24(19).
PMID: 37833886 PMC: 10572457. DOI: 10.3390/ijms241914439.
Comparative genomic analysis of the principal species that infect humans.
Arias-Agudelo L, Garcia-Montoya G, Cabarcas F, Galvan-Diaz A, Alzate J PeerJ. 2020; 8:e10478.
PMID: 33344091 PMC: 7718795. DOI: 10.7717/peerj.10478.