Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/15024
Full metadata record
DC FieldValueLanguage
dc.contributor.authorTiberti, M-
dc.contributor.authorPandini, A-
dc.contributor.authorFraternali, F-
dc.contributor.authorFornili, A-
dc.date.accessioned2017-08-15T12:49:36Z-
dc.date.available2017-08-15T12:49:36Z-
dc.date.issued2017-
dc.identifier.citationBioinformatics, 2017en_US
dc.identifier.issn1367-4803-
dc.identifier.urihttp://bura.brunel.ac.uk/handle/2438/15024-
dc.description.abstractMotivation: A deleterious amino acid change in a protein can be compensated by a second-site rescue mutation. These compensatory mechanisms can be mimicked by drugs. In particular, the location of rescue mutations can be used to identify protein regions that can be targeted by small molecules to reactivate a damaged mutant. Results: We present the first general computational method to detect rescue sites. By mimicking the effect of mutations through the application of forces, the Double Force Scanning (DFS) method identifies the second-site residues that make the protein structure most resilient to the effect of pathogenic mutations. We tested DFS predictions against two datasets containing experimentally validated and putative evolutionary-related rescue sites. A remarkably good agreement was found between predictions and experimental data. Indeed, almost half of the rescue sites in p53 was correctly predicted by DFS, with 65% of remaining sites in contact with DFS predictions. Similar results were found for other proteins in the evolutionary dataset.en_US
dc.language.isoenen_US
dc.titleIn silico identification of rescue sites by double force scanningen_US
dc.typeArticleen_US
dc.identifier.doihttp://dx.doi.org/10.1093/bioinformatics/btx515-
dc.relation.isPartOfBioinformatics-
pubs.publication-statusPublished online-
Appears in Collections:Dept of Computer Science Research Papers

Files in This Item:
File Description SizeFormat 
FullText.pdf697.23 kBAdobe PDFView/Open


Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.