Revisiting chameleon sequences in the protein data bank (Q2331631)

From MaRDI portal
Revision as of 15:35, 19 March 2024 by Openalex240319020357 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Revisiting chameleon sequences in the protein data bank
scientific article

    Statements

    Revisiting chameleon sequences in the protein data bank (English)
    0 references
    0 references
    0 references
    0 references
    30 October 2019
    0 references
    Summary: The steady growth of the Protein Data Bank (PDB) suggests the periodic repetition of searches for sequences that form different secondary structures in different protein structures; these are called chameleon sequences. This paper presents a fast \((n\log (n))\) algorithm for such searches and presents the results on all protein structures in the PDB. The longest such sequence found consists of 20 residues.
    0 references
    0 references
    chameleon sequence
    0 references
    residue propensity
    0 references
    protein data bank
    0 references
    0 references
    0 references
    0 references
    0 references