Jacek Blazewicz

Prof. Dr. Jacek Blazewicz

Poznań University of Technology, Poznań, Wielkopolskie, Poland
orcid

Research Focus & Metrics

Academic Career Length

48Years (1979-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 1983 in Discrete Applied Mathematics
Verified
Journal Article
Closed access
JBJacek Blazewicz
Jacek Blazewicz
JLJ.K. Lenstra
J.K. Lenstra
AKA.H.G.Rinnooy Kan
A.H.G.Rinnooy Kan

26 April 2012 in Nucleic Acids Research
Verified
Journal Article
Open access
PDF file
MPMariusz Popenda
Mariusz Popenda
MSMarta Szachniuk
Marta Szachniuk
MAMaciej Antczak
Maciej Antczak
KPKatarzyna J. Purzycka
Katarzyna J. Purzycka
PLPiotr Lukasiak
Piotr Lukasiak
RARyszard W. Adamiak
Ryszard W. Adamiak
Understanding the numerous functions that RNAs play in living cells depends critically on knowledge of their three-dimensional structure. Due to the difficulties in experimentally assessing structures of large RNAs, there is currently great demand for new high-resolution structure prediction methods. We present the novel method for the fully automated prediction of RNA 3D structures from a user-defined secondary structure. The concept is founded on the machine translation system. The translation engine operates on the RNA FRABASE database tailored to the dictionary relating the RNA secondary structure and tertiary structure elements. The translation algorithm is very fast. Initial 3D structure is composed in a range of seconds on a single processor. The method assures the prediction of large RNA 3D structures of high quality. Our approach needs neither structural templates nor RNA sequence alignment, required for comparative methods. This enables the building of unresolved yet native and artificial RNA structures. The method is implemented in a publicly available, user-friendly server RNAComposer. It works in an interactive mode and a batch mode. The batch mode is designed for large-scale modelling and accepts atomic distance restraints. Presently, the server is set to build RNA structures of up to 500 residues.

1 August 1996 in European Journal of Operational Research
Verified
Journal Article
Closed access
JBJacek Blazewicz
Jacek Blazewicz
WDWolfgang Domschke
Wolfgang Domschke
EPErwin Pesch
Erwin Pesch

1 May 1986 in IEEE Transactions on Computers
Verified
Journal Article
Closed access
JBJacek Blazewicz
Jacek Blazewicz
DRDrabowski
Drabowski
WEWeglarz
Weglarz
The problem considered in this paper is the deterministic scheduling of tasks on a set of identical processors. However, the model presented differs from the classical one by the requirement that certain tasks need more than one processor at a time for their processing. This assumption is especially justified in some microprocessor applications and its impact on the complexity of minimizing schedule length is studied. First we concentrate on the problem of nonpreemptive scheduling. In this case, polynomial-time algorithms exist only for unit processing times. We present two such algorithms of complexity O(n) for scheduling tasks requiring an arbitrary number of processors between 1 and k at a time where k is a fixed integer. The case for which k is not fixed is shown to be NP-complete. Next, the problem of preemptive scheduling of tasks of arbitrary length is studied. First an algorithm for scheduling tasks requiring one or k processors is presented. Its complexity depends linearly on the number of tasks. Then, the possibility of a linear programming formulation for the general case is analyzed.

25 September 2016
Verified
Book Chapter
Closed access
PDF file
MBMarcin Biesiada
Marcin Biesiada
KPKatarzyna J. Purzycka
Katarzyna J. Purzycka
MSMarta Szachniuk
Marta Szachniuk
JBJacek Blazewicz
Jacek Blazewicz
RARyszard W. Adamiak
Ryszard W. Adamiak

6 May 2010 in BMC Bioinformatics
Verified
Journal Article
Open access
PDF file
MPMariusz Popenda
Mariusz Popenda
MSMarta Szachniuk
Marta Szachniuk
MBMarek Blazewicz
Marek Blazewicz
SWSzymon Wasik
Szymon Wasik
EBEdmund K Burke
Edmund K Burke
RARyszard W Adamiak
Ryszard W Adamiak
Background: Recent discoveries concerning novel functions of RNA, such as RNA interference, have contributed towards the growing importance of the field. In this respect, a deeper knowledge of complex three-dimensional RNA structures is essential to understand their new biological functions. A number of bioinformatic tools have been proposed to explore two major structural databases (PDB, NDB) in order to analyze various aspects of RNA tertiary structures. One of these tools is RNA FRABASE 1.0, the first web-accessible database with an engine for automatic search of 3D fragments within PDB-derived RNA structures. This search is based upon the user-defined RNA secondary structure pattern. In this paper, we present and discuss RNA FRABASE 2.0. This second version of the system represents a major extension of this tool in terms of providing new data and a wide spectrum of novel functionalities. An intuitionally operated web server platform enables very fast user-tailored search of three-dimensional RNA fragments, their multi-parameter conformational analysis and visualization.Description: RNA FRABASE 2.0 has stored information on 1565 PDB-deposited RNA structures, including all NMR models. The RNA FRABASE 2.0 search engine algorithms operate on the database of the RNA sequences and the new library of RNA secondary structures, coded in the dot-bracket format extended to hold multi-stranded structures and to cover residues whose coordinates are missing in the PDB files. The library of RNA secondary structures (and their graphics) is made available. A high level of efficiency of the 3D search has been achieved by introducing novel tools to formulate advanced searching patterns and to screen highly populated tertiary structure elements. RNA FRABASE 2.0 also stores data and conformational parameters in order to provide "on the spot" structural filters to explore the three-dimensional RNA structures. An instant visualization of the 3D RNA structures is provided. RNA FRABASE 2.0 is freely available athttp://rnafrabase.cs.put.poznan.pl.Conclusions: RNA FRABASE 2.0 provides a novel database and powerful search engine which is equipped with new data and functionalities that are unavailable elsewhere. Our intention is that this advanced version of the RNA FRABASE will be of interest to all researchers working in the RNA field.