A deterministic algorithm for constrained enumeration of transmembrane protein folds

DOI10.1016/J.COMPBIOLCHEM.2005.03.001zbMATH Open1096.92014OpenAlexW2048104038WikidataQ51976116 ScholiaQ51976116MaRDI QIDQ2500286FDOQ2500286

Authors: W. Michael Brown, Jean-Loup Faulon, Ken Sale 

Publication date: 23 August 2006

Published in: Computational Biology and Chemistry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.compbiolchem.2005.03.001

Recommendations

• Optimizing an empirical scoring function for transmembrane protein structure determination
• Modeling and predicting all-\(\alpha\) transmembrane proteins including helix-helix pairing
• Exact enumeration of three-dimensional lattice proteins
• On permuted super-secondary structures of transmembrane \(\beta\)-barrel proteins
• The algorithmics of folding proteins on lattices.

zbMATH Keywords

Protein foldsDistance constraintsHelix packingTransmembrane helices

Mathematics Subject Classification ID

Biochemistry, molecular biology (92C40) Software, source code, etc. for problems pertaining to biology (92-04)

Cites Work

• Constrained walks and self-avoiding walks: implications for protein structure determination

Cited In (3)

• Optimizing an empirical scoring function for transmembrane protein structure determination
• Exact enumeration of three-dimensional lattice proteins
• An algorithm for computing the restriction s|caffold assignment problem in computational biology

This page was built for publication: A deterministic algorithm for constrained enumeration of transmembrane protein folds

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2500286)