Skip to main content

Lund University Publications

LUND UNIVERSITY LIBRARIES

Solving Hard Problems by Protein Folding?

Lingas, Andrzej LU (2020) 9th International Conference on Theory and Practice of Natural Computing, TPNC 2020 In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 12494 LNCS. p.36-41
Abstract

Inspired by the NP-hardness of string folding problems modeling the natural process of protein folding, we discuss the idea of solving instances of NP-hard problems (e.g., string folding problems) of moderate size by letting artificially assembled proteins to fold. The accuracy with which one can combinatorially model the protein folding process, e.g., by string folding, as well as the precision with which one could experimentally estimate the energy of folded artificial proteins are crucial issues.

Please use this url to cite or link to this publication:
author
organization
publishing date
type
Chapter in Book/Report/Conference proceeding
publication status
published
subject
keywords
Hard problems, Protein folding
host publication
Theory and Practice of Natural Computing - 9th International Conference, TPNC 2020, Proceedings
series title
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
editor
Martín-Vide, Carlos ; Vega-Rodríguez, Miguel A. and Yang, Miin-Shen
volume
12494 LNCS
pages
6 pages
publisher
Springer Science and Business Media B.V.
conference name
9th International Conference on Theory and Practice of Natural Computing, TPNC 2020
conference location
Taoyuan, Taiwan
conference dates
2020-12-07 - 2020-12-09
external identifiers
  • scopus:85097643149
ISSN
1611-3349
0302-9743
ISBN
9783030629991
DOI
10.1007/978-3-030-63000-3_3
language
English
LU publication?
yes
id
de3396b5-1755-4b14-866c-5da82caf3799
date added to LUP
2021-01-11 07:48:36
date last changed
2024-09-05 13:37:40
@inproceedings{de3396b5-1755-4b14-866c-5da82caf3799,
  abstract     = {{<p>Inspired by the NP-hardness of string folding problems modeling the natural process of protein folding, we discuss the idea of solving instances of NP-hard problems (e.g., string folding problems) of moderate size by letting artificially assembled proteins to fold. The accuracy with which one can combinatorially model the protein folding process, e.g., by string folding, as well as the precision with which one could experimentally estimate the energy of folded artificial proteins are crucial issues.</p>}},
  author       = {{Lingas, Andrzej}},
  booktitle    = {{Theory and Practice of Natural Computing - 9th International Conference, TPNC 2020, Proceedings}},
  editor       = {{Martín-Vide, Carlos and Vega-Rodríguez, Miguel A. and Yang, Miin-Shen}},
  isbn         = {{9783030629991}},
  issn         = {{1611-3349}},
  keywords     = {{Hard problems; Protein folding}},
  language     = {{eng}},
  pages        = {{36--41}},
  publisher    = {{Springer Science and Business Media B.V.}},
  series       = {{Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)}},
  title        = {{Solving Hard Problems by Protein Folding?}},
  url          = {{http://dx.doi.org/10.1007/978-3-030-63000-3_3}},
  doi          = {{10.1007/978-3-030-63000-3_3}},
  volume       = {{12494 LNCS}},
  year         = {{2020}},
}