Adjustable chain trees for proteins

Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › fagfællebedømt

Standard

Adjustable chain trees for proteins. / Winter, Pawel; Fonseca, Rasmus.

I: Journal of Computational Biology, Bind 19, Nr. 1, 2012, s. 83-99.

Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › fagfællebedømt

Harvard

Winter, P & Fonseca, R 2012, 'Adjustable chain trees for proteins', Journal of Computational Biology, bind 19, nr. 1, s. 83-99. https://doi.org/10.1089/cmb.2010.0320

APA

Winter, P., & Fonseca, R. (2012). Adjustable chain trees for proteins. Journal of Computational Biology, 19(1), 83-99. https://doi.org/10.1089/cmb.2010.0320

Vancouver

Winter P, Fonseca R. Adjustable chain trees for proteins. Journal of Computational Biology. 2012;19(1):83-99. https://doi.org/10.1089/cmb.2010.0320

Author

Winter, Pawel ; Fonseca, Rasmus. / Adjustable chain trees for proteins. I: Journal of Computational Biology. 2012 ; Bind 19, Nr. 1. s. 83-99.

Bibtex

@article{a1e23c184eb042c097c0844433bd67fe,
title = "Adjustable chain trees for proteins",
abstract = "A chain tree is a data structure for changing protein conformations. It enables very fast detection of clashes and free energy potential calculations. A modified version of chain trees that adjust themselves to the changing conformations of folding proteins is introduced. This results in much tighter bounding volume hierarchies and therefore fewer intersection checks. Computational results indicate that the efficiency of the adjustable chain trees is significantly improved compared to the traditional chain trees.",
author = "Pawel Winter and Rasmus Fonseca",
year = "2012",
doi = "10.1089/cmb.2010.0320",
language = "English",
volume = "19",
pages = "83--99",
journal = "Journal of Computational Biology",
issn = "1066-5277",
publisher = "Mary Ann Liebert, Inc. Publishers",
number = "1",

}

RIS

TY - JOUR

T1 - Adjustable chain trees for proteins

AU - Winter, Pawel

AU - Fonseca, Rasmus

PY - 2012

Y1 - 2012

N2 - A chain tree is a data structure for changing protein conformations. It enables very fast detection of clashes and free energy potential calculations. A modified version of chain trees that adjust themselves to the changing conformations of folding proteins is introduced. This results in much tighter bounding volume hierarchies and therefore fewer intersection checks. Computational results indicate that the efficiency of the adjustable chain trees is significantly improved compared to the traditional chain trees.

AB - A chain tree is a data structure for changing protein conformations. It enables very fast detection of clashes and free energy potential calculations. A modified version of chain trees that adjust themselves to the changing conformations of folding proteins is introduced. This results in much tighter bounding volume hierarchies and therefore fewer intersection checks. Computational results indicate that the efficiency of the adjustable chain trees is significantly improved compared to the traditional chain trees.

U2 - 10.1089/cmb.2010.0320

DO - 10.1089/cmb.2010.0320

M3 - Journal article

C2 - 21548812

VL - 19

SP - 83

EP - 99

JO - Journal of Computational Biology

JF - Journal of Computational Biology

SN - 1066-5277

IS - 1

ER -

ID: 33926272