Autor: Antczak, Kacper. - Katalog OPAC zbiorów

Skocz do pozycji: 2.

Tytuł:: New models and algorithms for RNA pseudoknot order assignment
Autorzy:: Zok, Tomasz
Badura, Jan
Swat, Sylwester
Figurski, Kacper
Popenda, Mariusz
Antczak, Maciej
Powiązania:: https://bibliotekanauki.pl/articles/911230.pdf
Data publikacji:: 2020
Wydawca:: Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:: RNA pseudoknot order
conflict graph
vertex coloring
maximum independent set
integer programming
kolorowanie grafu
zbiór niezależny
programowanie całkowitoliczbowe
Opis:: The pseudoknot is a specific motif of the RNA structure that highly influences the overall shape and stability of a molecule. It occurs when nucleotides of two disjoint single-stranded fragments of the same chain, separated by a helical fragment, interact with each other and form base pairs. Pseudoknots are characterized by great topological diversity, and their systematic description is still a challenge. In our previous work, we have introduced the pseudoknot order: a new coefficient representing the topological complexity of the pseudoknotted RNA structure. It is defined as the minimum number of base pair set decompositions, aimed to obtain the unknotted RNA structure. We have suggested how it can be useful in the interpretation and understanding of a hierarchy of RNA folding. However, it is not trivial to unambiguously identify pseudoknots and determine their orders in an RNA structure. Therefore, since the introduction of this coefficient, we have worked on the method to reliably assign pseudoknot orders in correspondence to the mechanisms that control the biological process leading to their formation in the molecule. Here, we introduce a novel graph coloring-based model for the problem of pseudoknot order assignment. We show a specialized heuristic operating on the proposed model and an alternative integer programming algorithm. The performance of both approaches is compared with that of state-of-the-art algorithms which so far have been most efficient in solving the problem in question. We summarize the results of computational experiments that evaluate our new methods in terms of classification quality on a representative data set originating from the non-redundant RNA 3D structure repository.
Źródło:: International Journal of Applied Mathematics and Computer Science; 2020, 30, 2; 315-324
1641-876X
2083-8492
Pojawia się w:: International Journal of Applied Mathematics and Computer Science
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Informacja

Wyszukujesz frazę "Antczak, Kacper." wg kryterium: Autor

Źródło danych

Dostawca treści

Podbaza

Kolekcja

Rok wydania

Wydawca

Temat

Autor

Typ dokumentu

Język