Automated rendering of multi-stranded DNA complexes with pseudoknots

Loading...
Thumbnail Image

Access rights

openAccess
acceptedVersion

URL

Journal Title

Journal ISSN

Volume Title

A4 Artikkeli konferenssijulkaisussa

Date

Major/Subject

Mcode

Degree programme

Language

en

Pages

13

Series

Unconventional Computation and Natural Computation - 21st International Conference, UCNC 2024, Proceedings, pp. 190-202, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) ; Volume 14776 LNCS

Abstract

We present a general method for rendering representations of multi-stranded DNA complexes from textual descriptions into 2D diagrams. The complexes can be arbitrarily pseudoknotted, and if a planar rendering is possible, the method will determine one in time which is essentially linear in the size of the textual description. (That is, except for a final stochastic fine-tuning step.) If a planar rendering is not possible, the method will compute a visually pleasing approximate rendering in quadratic time. Examples of diagrams produced by the method are presented in the paper.

Description

Publisher Copyright: © The Author(s), under exclusive license to Springer Nature Switzerland AG 2024.

Other note

Citation

Nowicka, M, Gautam, V K & Orponen, P 2024, Automated rendering of multi-stranded DNA complexes with pseudoknots. in D-J Cho & J Kim (eds), Unconventional Computation and Natural Computation - 21st International Conference, UCNC 2024, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 14776 LNCS, Springer, pp. 190-202, International Conference on Unconventional Computation and Natural Computation, Pohang, Korea, Republic of, 17/06/2024. https://doi.org/10.1007/978-3-031-63742-1_14