Amanote Research

Amanote Research

    RegisterSign In

On the Complexity of String Folding

Lecture Notes in Computer Science - Germany
doi 10.1007/3-540-61440-0_167
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer ScienceTheoretical Computer Science
Date

January 1, 1996

Authors
Mike PatersonTeresa Przytycka
Publisher

Springer Berlin Heidelberg


Related search

On the Complexity of Computing the Order of Repetition of a String

2000English

Complexity in Protein Folding: Simulation Meets Experiment

Current Physical Chemistry
2012English

Folding Minimal Sequences: The Lower Bound for Sequence Complexity of Globular Proteins

FEBS Letters
GeneticsCell BiologyMolecular BiologyBiochemistryStructural BiologyBiophysics
1999English

Simple Few-State Models Reveal Hidden Complexity in Protein Folding

Proceedings of the National Academy of Sciences of the United States of America
Multidisciplinary
2012English

On the Scattering of Gluons in the GKP String

Journal of High Energy Physics
High Energy PhysicsNuclear
2016English

Autocatalytic Folding of the Folding Catalyst FKBP12

Journal of Biological Chemistry
BiochemistryCell BiologyMolecular Biology
1996English

QCD Β -Function on the String Worldsheet

Physical Review D
AstronomyPhysics
2018English

Tensor Modes on the String Theory Landscape

Journal of High Energy Physics
High Energy PhysicsNuclear
2013English

On the Complexity of Computing Treebreadth

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2016English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy