<HashMap><database>biostudies-literature</database><scores/><additional><omics_type>Unknown</omics_type><volume>16(7)</volume><submitter>Hartmann C</submitter><pubmed_abstract>We introduce a new algorithm, IRECS (Iterative REduction of Conformational Space), for identifying ensembles of most probable side-chain conformations for homology modeling. On the basis of a given rotamer library, IRECS ranks all side-chain rotamers of a protein according to the probability with which each side chain adopts the respective rotamer conformation. This ranking enables the user to select small rotamer sets that are most likely to contain a near-native rotamer for each side chain. IRECS can therefore act as a fast heuristic alternative to the Dead-End-Elimination algorithm (DEE). In contrast to DEE, IRECS allows for the selection of rotamer subsets of arbitrary size, thus being able to define structure ensembles for a protein. We show that the selection of more than one rotamer</pubmed_abstract><journal>Protein science : a publication of the Protein Society</journal><pagination>1294-307</pagination><full_dataset_link>https://www.ebi.ac.uk/biostudies/studies/S-EPMC2206697</full_dataset_link><repository>biostudies-literature</repository><pubmed_title>IRECS: a new algorithm for the selection of most probable ensembles of side-chain conformations in protein models.</pubmed_title><pmcid>PMC2206697</pmcid><pubmed_authors>Lengauer T</pubmed_authors><pubmed_authors>Antes I</pubmed_authors><pubmed_authors>Hartmann C</pubmed_authors></additional><is_claimable>false</is_claimable><name>IRECS: a new algorithm for the selection of most probable ensembles of side-chain conformations in protein models.</name><description>We introduce a new algorithm, IRECS (Iterative REduction of Conformational Space), for identifying ensembles of most probable side-chain conformations for homology modeling. On the basis of a given rotamer library, IRECS ranks all side-chain rotamers of a protein according to the probability with which each side chain adopts the respective rotamer conformation. This ranking enables the user to select small rotamer sets that are most likely to contain a near-native rotamer for each side chain. IRECS can therefore act as a fast heuristic alternative to the Dead-End-Elimination algorithm (DEE). In contrast to DEE, IRECS allows for the selection of rotamer subsets of arbitrary size, thus being able to define structure ensembles for a protein. We show that the selection of more than one rotamer</description><dates><release>2007-01-01T00:00:00Z</release><publication>2007 Jul</publication><modification>2025-04-25T21:20:44.971Z</modification><creation>2019-03-27T02:43:49Z</creation></dates><accession>S-EPMC2206697</accession><cross_references><pubmed>17567749</pubmed><doi>10.1110/ps.062658307</doi></cross_references></HashMap>