Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "Błażewicz, Jacek" wg kryterium: Autor

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-5 z 5
    Tytuł:
    Two meta-heuristic algorithms for scheduling on unrelated machines with the late work criterion
    Autorzy:
    Wang, Wen
    Chen, Xin
    Musial, Jędrzej
    Blazewicz, Jacek
    Powiązania:
    https://bibliotekanauki.pl/articles/330022.pdf
    Data publikacji:
    2020
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    late work minimization
    unrelated machines
    tabu search
    genetic algorithm
    minimalizacja opóźnienia
    przeszukiwanie tabu
    algorytm genetyczny
    Opis:
    A scheduling problem in considered on unrelated machines with the goal of total late work minimization, in which the late work of a job means the late units executed after its due date. Due to the NP-hardness of the problem, we propose two meta-heuristic algorithms to solve it, namely, a tabu search (TS) and a genetic algorithm (GA), both of which are equipped with the techniques of initialization, iteration, as well as termination. The performances of the designed algorithms are verified through computational experiments, where we show that the GA can produce better solutions but with a higher time consumption. Moreover, we also analyze the influence of problem parameters on the performances of these metaheuristics.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2020, 30, 3; 573-584
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Computational prediction of non-enzymatic RNA degradation patterns
    Autorzy:
    Rybarczyk, Agnieszka
    Jackowiak, Paulina
    Figlerowicz, Marek
    Blazewicz, Jacek
    Powiązania:
    https://bibliotekanauki.pl/articles/1038733.pdf
    Data publikacji:
    2016
    Wydawca:
    Polskie Towarzystwo Biochemiczne
    Tematy:
    RNA degradation
    non-enzymatic RNA hydrolysis
    branch-and-cut algorithm
    Opis:
    Since the beginning of the 21st century, an increasing interest in the research of ribonucleic acids has been observed in response to a surprising discovery of the role that RNA molecules play in the biological systems. It was demonstrated that they do not only take part in the protein synthesis (mRNA, rRNA, tRNA) but also are involved in the regulation of gene expression. Several classes of small regulatory RNAs have been discovered (e.g. microRNA, small interfering RNA, piwiRNA). Most of them are excised from specific double-stranded RNA precursors by enzymes that belong to the RNaseIII family (Drosha, Dicer or Dicer-like proteins). More recently, it has been shown that small regulatory RNAs are also generated as stable intermediates of RNA degradation (the so called RNA fragments originating from tRNA, snRNA, snoRNA etc.). Unfortunately, the mechanisms underlying biogenesis of the RNA fragments remain unclear. It is thought that several factors may be involved in the formation of the RNA fragments. The most important are the specific RNases, RNA-protein interactions and RNA structure. In this work, we focus on the RNA primary and secondary structures as factors influencing the RNA stability and consequently the pattern of RNA fragmentation. Earlier, we identified the major structural factors affecting non-enzymatic RNA degradation. Now, based on these data, we developed a new branch-and-cut algorithm that is able to predict the products of large RNA molecules' hydrolysis in vitro. We also present the experimental data that verify the results generated using this algorithm.
    Źródło:
    Acta Biochimica Polonica; 2016, 63, 4; 745-751
    0001-527X
    Pojawia się w:
    Acta Biochimica Polonica
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    AmiRNA Designer - new method of artificial miRNA design
    Autorzy:
    Mickiewicz, Agnieszka
    Rybarczyk, Agnieszka
    Sarzynska, Joanna
    Figlerowicz, Marek
    Blazewicz, Jacek
    Powiązania:
    https://bibliotekanauki.pl/articles/1038843.pdf
    Data publikacji:
    2016
    Wydawca:
    Polskie Towarzystwo Biochemiczne
    Tematy:
    artificial miRNA
    RNAi
    gene regulation
    sequence specific
    thermodynamic profiles
    Opis:
    MicroRNAs (miRNAs) are small non-coding RNAs that have been found in most of the eukaryotic organisms. They are involved in the regulation of gene expression at the post-transcriptional level in a sequence specific manner. MiRNAs are produced from their precursors by Dicer-dependent small RNA biogenesis pathway. Involvement of miRNAs in a wide range of biological processes makes them excellent candidates for studying gene function or for therapeutic applications. For this purpose, different RNA-based gene silencing techniques have been developed. Artificially transformed miRNAs (amiRNAs) targeting one or several genes of interest represent one of such techniques being a potential tool in functional genomics. Here, we present a new approach to amiRNA*design, implemented as AmiRNA Designer software. Our method is based on the thermodynamic analysis of the native miRNA/miRNA* and miRNA/target duplexes. In contrast to the available automated tools, our program allows the user to perform analysis of natural miRNAs for the organism of interest and to create customized constraints for the design stage. It also provides filtering of the amiRNA candidates for the potential off-targets. AmiRNA Designer is freely available at http://www.cs.put.poznan.pl/arybarczyk/AmiRNA/.
    Źródło:
    Acta Biochimica Polonica; 2016, 63, 1; 71-77
    0001-527X
    Pojawia się w:
    Acta Biochimica Polonica
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Exact approaches to late work scheduling on unrelated machines
    Autorzy:
    Liu, Xinbo
    Wang, Wen
    Chen, Xin
    Sterna, Malgorzata
    Blazewicz, Jacek
    Powiązania:
    https://bibliotekanauki.pl/articles/11542692.pdf
    Data publikacji:
    2023
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    late work scheduling
    unrelated machine
    mathematical model
    branch algorithm
    bound algorithm
    dynamic programming
    planowanie pracy
    model matematyczny
    algorytm podziału
    algorytm ograniczeń
    programowanie dynamiczne
    Opis:
    We consider the scheduling problem on unrelated parallel machines in order to minimize the total late work. Since the problem is NP-hard, we propose a mathematical model and two dedicated exact approaches for solving it, based on the branching and bounding strategy and on enumerating combined with a dynamic programming algorithm. The time efficiencies of all three approaches are evaluated through computational experiments.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2023, 33, 2; 285--295
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Translational and structural analysis of the shortest legume ENOD40 gene in Lupinus luteus
    Autorzy:
    Podkowinski, Jan
    Zmienko, Agnieszka
    Florek, Blazena
    Wojciechowski, Pawel
    Rybarczyk, Agnieszka
    Wrzesinski, Jan
    Ciesiolka, Jerzy
    Blazewicz, Jacek
    Kondorosi, Adam
    Crespi, Martin
    Legocki, Andrzej
    Powiązania:
    https://bibliotekanauki.pl/articles/1040638.pdf
    Data publikacji:
    2009
    Wydawca:
    Polskie Towarzystwo Biochemiczne
    Tematy:
    nitrogen fixation
    transcript structure
    ENOD40
    phylogeny
    Opis:
    Two early nodulin 40 (enod40) genes, ENOD40-1, the shortest legume ENOD40 gene, and ENOD40-2, were isolated from Lupinus luteus, a legume with indeterminate nodules. Both genes were expressed at similar levels during symbiosis with nitrogen-fixing bacteria. ENOD40 phylogeny clustered the L. luteus genes with legumes forming determinate nodules and revealed peptide similarities. The ENOD40-1 small ORF A fused to a reporter gene was efficiently expressed in plant cells, indicating that the start codon is recognized for translation. The ENOD40-1 RNA structure predicted based on Pb(II)-induced cleavage and modeling revealed four structurally conserved domains, an absence of domain 4 characteristic for legumes of indeterminate nodules, and interactions between the conserved region I and a region located upstream of domain 6. Domain 2 contains Mg(II) ion binding sites essential for organizing RNA secondary structure. The differences between L. luteus and Glycine max ENOD40 RNA models suggest the possibility of a switch between two structural states of ENOD40 transcript.
    Źródło:
    Acta Biochimica Polonica; 2009, 56, 1; 89-102
    0001-527X
    Pojawia się w:
    Acta Biochimica Polonica
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-5 z 5

      Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies