PL
 |
EN
Nowa wersja platformy, zawierająca wyłącznie zasoby pełnotekstowe, jest już dostępna.
Przejdź na https://bibliotekanauki.pl
Preferencje help
Polish version English version Język
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 13

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Algorytmy tabu Search dla problemów szeregowania zadań na jednej maszynie z ograniczoną dostępnością
100%
Formanowicz P.
|
2002
|
tom z. 134
115-126
PL
W pracy zaprezentowano algorytmy oparte na metodzie tabu dla problemów szeregowania zadań niepodzielnych na jednej maszynie z okresami niedostępności i kryterium minimalizacji długości uszeregowania, sumy czasów zakończeni zadań oraz maksymalnego opóźnienia. Jakość zaprezentowanych algorytmów przebadano w obszernym eksperymencie obliczeniowym.
EN
In the paper algorithms based on tabu search method for scheduling non-preemptable tasks on a single machine with limited availability have been presented. The criterion functions to be minimized are the makespan, the total completion time, and the maximum lateness. The quality of the algorithms has been examined in an extensive computational experiment.
2
Content available remote Problemy izotermicznego sekwencjonowania przez hybrydyzację z informacją o powtórzeniach
100%
Formanowicz P.
|
|
tom R. 84, nr 9
103-107
PL
W pracy przedstawiono formalne definicje różnych wariantów problemu izotermicznego sekwencjonowania przez hybrydyzację z dodatkową informacją o powtórzeniach. W większośći przypadków podano złożoność obliczeniową oraz sformuowano odpowiedniki grafowe rozważanych problemów.
EN
In the paper formal definitions of many variants of the isotherimc sequencing by hybridization problem with additional information about repetitions are presented. For most of the problems their computational complexity is determined and graph theoretical counterparts are also formulated.
3
Content available remote Algorytmy dla problemów sekwencjonowania przez hybrydyzację opartych o nieklasyczne chipy DNA
63%
Radom M. , Formanowicz P.
|
|
tom R. 86, nr 9
97-100
PL
W niniejszym artykule przedstawione zostaną algorytmy dla problemów sekwencjonowania przez hybrydyzację opartych o dwa nieklasyczne chipy DNA. Opisane zostaną zasady kontrukcji rozpatrywanych chipów oraz sposób działania algorytmów rozwiązujących problem SBH z ich pomocą. Przedstawione zostaną także wyniki eksperymentów obliczeniowych, w których testowane będą omawiane algorytmy oraz algorytm klasyczny.
EN
In this paper algorithms for sequencing by hybridization problems based on two non-classical DNA chips are presented. The idea of these chips is briefly described and the algorithms are presented and analyzed in detail. Also the results of an extensive experiment are showed and commented.
4
Content available The Fan-Raspaud conjecture: A randomized algorithmic approach and application to the pair assignment problem in cubic networks
63%
Formanowicz P. , Tanaś K.
|
2012
|
tom Vol. 22, no. 3
765-778
EN
It was conjectured by Fan and Raspaud (1994) that every bridgeless cubic graph contains three perfect matchings such that every edge belongs to at most two of them. We show a randomized algorithmic way of finding Fan-Raspaud colorings of a given cubic graph and, analyzing the computer results, we try to find and describe the Fan-Raspaud colorings for some selected classes of cubic graphs. The presented algorithms can then be applied to the pair assignment problem in cubic computer networks. Another possible application of the algorithms is that of being a tool for mathematicians working in the field of cubic graph theory, for discovering edge colorings with certain mathematical properties and formulating new conjectures related to the Fan-Raspaud conjecture.
5
Content available Some aspects of modeling and analysis of complex biological systems using time Petri nets
51%
Olszak J. , Radom M. , Formanowicz P.
|
|
nr 1
6
Content available Some aspects of modeling and analysis of complex biological systems using time Petri nets
51%
Olszak J. , Radom M. , Formanowicz P.
|
|
tom Vol. 66, nr 1
67--78
EN
Models of complex biological systems can be built using different types of Petri nets. Qualitative nets, for example, can be successfully used to obtain a model of such a system and on its basis a structure-based analysis can be performed. Time is an important factor influencing a whole biological system behaviour and in many cases it should be considered during building a model of such a system. In this paper various types of time Petri nets have been described and methods for studying corresponding models have been discussed. In particular, an algorithm using time parameters to enhance t-invariants based analysis is proposed. This algorithm allows for calculation of the minimal and maximal numbers of tokens (respectively, for an optimistic and pessimistic case) in particular places necessary to assure that all transitions from a given t-invariant support will be able to fire. Additionally, to address the problem of the proper assignment of time values to transitions, the known methods for calculation and evaluation of such time parameters based on the net structure have also been discussed.
7
Zastosowanie sieci Petriego do modelowania procesow biologicznych
51%
Blazewicz J. , Formanowicz D. , Formanowicz P.
|
|
nr 1-2
79-88
8
Content available remote On graph theoretical models for peptide sequence assembly
51%
Błażewicz J. , Borowski M. , Formanowicz P. , Głowacki T.
Foundations of Computing and Decision Sciences
|
2005
|
tom Vol. 30, No. 3
183-191
EN
The amino acid sequences of proteins determine their structure and functionality, hence methods for reading such sequences are crucial for many areas of biological sciences. Obviously, the genetic information encoding proteins is written in DNA however, knowing gene sequences is not always sufficient for determining the corresponding amino acid sequences. Since direct methods for reading amino acid seqeunces allow for determination of only very short fragments, some methods for assembly of these fragments are required. In this paper, we show and analyze some graph theoretic models of the peptide sequence assembly process.
9
Content available remote Clustal W algorithm for multiple sequence alignment revisited
45%
Błażewicz J. , Formanowicz P. , Kasprzak M. , Michalak K. , Wierzejewski P.
|
|
tom Vol. 26, No. 3
189-196
EN
Multiple sequence alignment is one of the most important problems arising in DNA and protein recognition. Clustal W is a well known and practically [ applied method used for solving the problem. In the paper, a modification of the algorithm is described which shortens considerably its mean running time. The modification uses graphs of partial alignments and operations on resulting semi-cliques. As shown by an extensive computational experiment running time is reduced up to 50%, as compared with the original approach.
10
Mikromacierze DNA - zasady projektowania sond
45%
Formanowicz P. , Urbaniak R. , Handschuh L. , Formanowicz D. , Figlerowicz M.
|
|
nr 4
54-67
11
Studies of SIAH1, potential mRNA target for NANOS1-PUMILIO2 protein complex in the human germ cells
38%
Spik A. , Oczkowski S. , Blazewicz J. , Kotecki M. , Formanowicz P. , Jaruzelska J.
|
|
nr Supplement 1
12
Content available Computational methods in diagnostics of chronic hepatitis C
32%
Kędziora P. , Figlerowicz M. , Formanowicz P. , Alejska M. , Jackowiak P. , Malinowska N. , Frątczak A. , Błażewicz J.
|
|
nr 3
13
Assembling the SARS-CoV genome - new method based on graph theoretical approach
32%
Blazewicz J. , Figlerowicz M. , Formanowicz P. , Kasprzak M. , Nowierski B. , Styszynski R. , Szajkowski L. , Widera P. , Wiktorczyk M.
|
|
nr 4
EN
Nowadays, scientists may learn a lot about the organisms studied just by analyzing their genetic material. This requires the development of methods of reading genomes with high accuracy. It has become clear that the knowledge of the changes occuring within a viral genome is indispensable for effective fighting of the pathogen. A good example is SARS-CoV, which was a cause of death of many people and frightened the entire world with its fast and hard to prevent propagation. Rapid development of se­quencing methods, like shotgun sequencing or sequencing by hybridization (SBH), gives scientists a good tool for reading genomes. However, since sequencing meth­ods can read fragments of up to 1000 bp only, methods for sequence assembling are required in order to read whole genomes. In this paper a new assembling method, based on graph theoretical approach, is presented. The method was tested on SARS-CoV and the results were compared to the outcome of other widely known methods.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.