A deterministic algorithm for constrained enumeration of transmembrane protein folds

DOI10.1016/J.COMPBIOLCHEM.2005.03.001MaRDI QIDQ2500286zbMATH OpenOpenAlexWikidataFDO

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

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)

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.

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)