Information-theoretic inference of an optimal dictionary of protein supersecondary structures

LA home

also see

A. S. Konagurthu, R. Subramanian, L. Allison, D. Abramson, M. Garcia de la Banda, P. J. Stuckey, A. M. Lesk

A chapter in, Protein Supersecondary Structures, Springer, pp.123-131, April 2019

Abstract: We recently developed an unsupervised Bayesian inference methodology to automatically infer a dictionary of protein supersecondary structures (Subramanian et al., IEEE data compression conference proceedings (DCC), 340–349, 2017). Specifically, this methodology uses the information-theoretic framework of minimum message length (MML) criterion for hypothesis selection (Wallace, Statistical and inductive inference by minimum message length, Springer Science & Business Media, New York, 2005). The best dictionary of supersecondary structures is the one that yields the most (lossless) compression on the source collection of folding patterns represented as tableaux (matrix representations that capture the essence of protein folding patterns (Lesk, J Mol Graph. 13:159–164, 1995). This book chapter outlines our MML methodology for inferring the supersecondary structure dictionary. The inferred dictionary is available at [www(click)][/4/2019]."

— [doi:10.1007/978-1-4939-9161-7_6][2019].


↑ © L. Allison,   (or as otherwise indicated).
Created with "vi (Linux)",  charset=iso-8859-1,   fetched Thursday, 09-Jul-2020 11:34:02 EDT.

Free: Linux, Ubuntu operating-sys, OpenOffice office-suite, The GIMP ~photoshop, Firefox web-browser, FlashBlock flash on/off.