Filtry
wszystkich: 2026
wybranych: 1619
-
Katalog
- Publikacje 1619 wyników po odfiltrowaniu
- Czasopisma 66 wyników po odfiltrowaniu
- Konferencje 8 wyników po odfiltrowaniu
- Wydawnictwa 1 wyników po odfiltrowaniu
- Osoby 30 wyników po odfiltrowaniu
- Wynalazki 1 wyników po odfiltrowaniu
- Projekty 4 wyników po odfiltrowaniu
- Zespoły Badawcze 2 wyników po odfiltrowaniu
- Kursy Online 15 wyników po odfiltrowaniu
- Wydarzenia 4 wyników po odfiltrowaniu
- Dane Badawcze 276 wyników po odfiltrowaniu
Filtry wybranego katalogu
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: gene cloning
-
Beta-2 adrenoreceptor gene polymorphisms and sympathetic outflow in humans
Publikacja -
Hopf bifurcation in time‐delayed gene expression model with dimers
PublikacjaWe study a mathematical model of gene transcription and protein synthesis with negative feedback. We consider a system of equations taking into account the formation of dimers (i.e., complex formed by two protein monomers), the way in which dimers bind to DNA and time delay in translation process. For the model consisting of three ordinary differential equations with time delay, we derive conditions for stability of the positive...
-
RecA Proteins from Deinococcus geothermalis and Deinococcus murrayi - Cloning, Purification and Biochemical Characterisation
PublikacjaEscherichia coli RecA plays a crucial role in recombinational processes, the induction of SOS response and mutagenic lesion bypasses. It has also been demonstrated that RecA protein is indispensable when it comes to the reassembly of shattered chromosomes in gamma-irradiated Deinococcus radiodurans, one of the most radiation-resistant organisms known. Moreover, some functional differences between E. coli and D. radiodurans RecA...
-
Koala graph coloring library: an open graph coloring library for real-world applications
PublikacjaPomimo intensywnej pracy naukowej na polu kolorowania grafów, nie jest znana kompletna i dedykowana biblioteka programistyczna. Celem artykułu jest zaproponowanie architektury takiej biblioteki. Celem jest spełnienie oczekiwań wypływających z rzeczywistych zastosowań, w szczególności spełnienie potrzeb wydajnościowych. Zaimplementowano szereg algorytmów cheurystycznego kolorowania grafów. Przyjętym językiem programowania jest C++....
-
A subset of two adherence systems, acute pro-inflammatory pap genes and invasion coding dra, fim, or sfa, increases the risk of Escherichia coli translocation to the bloodstream
PublikacjaAn analysis of the phylogenetic distribution and virulence genes of Escherichia coli isolates which predispose this bacteria to translocate from the urinary tract to the bloodstream is presented. One-dimensional analysis indicated that the occurrence of P fimbriae and α-hemolysin coding genes is more frequent among the E. coli which cause bacteremia. However, a two-dimensional analysis revealed that a combination of genes coding...
-
Interval Edge-Coloring of Graphs
Publikacja -
Brushing with additional cleaning restrictions
PublikacjaIn graph cleaning problems, brushes clean a graph by traversing it subject to certain rules. We consider the process where at each time step, a vertex that has at least as many brushes as incident, contaminated edges, sends brushes down these edges to clean them. Various problems arise, such as determining the minimum number of brushes (called the brush number) that are required to clean the entire graph. Here, we study a new variant...
-
Interval incidence graph coloring
PublikacjaIn this paper we introduce a concept of interval incidence coloring of graphs and survey its general properties including lower and upper bounds on the number of colors. Our main focus is to determine the exact value of the interval incidence coloring number χii for selected classes of graphs, i.e. paths, cycles, stars, wheels, fans, necklaces, complete graphs and complete k-partite graphs. We also study the complexity of the...
-
A note on mixed tree coloring
PublikacjaZaproponowano liniowy algorytm dla problemu kolorowania mieszanego w drzewach, uzyskując tym samym poprawę w stosunku do algorytmu o złożoności O(n^2) podanego w pracy [P. Hansen, J. Kuplinsky, D. de Werra, Mixed graph colorings, Math. Methods Oper. Res. 45 (1997) 145-160].
-
On efficient coloring of chordless graphs
PublikacjaArtykuł omawia zagadnienie optymalnego, wielomianowego rozpoznawania i kolorowania grafów bezcięciwowych. Zawiera dowód tego, że takie grafy są zawsze 4-kolorowalne oraz opis wielomianowego algorytmu, który koloruje je minimalną możliwą liczbą kolorów.
-
Mixed graph edge coloring
PublikacjaW pracy rozważany jest problem kolorowania krawędzi grafu mieszanego, tj. grafu zawierającego zawiero skierowane, jak i nieskierowane krawędzie. Motywację do badań stanowią zagadnienia komunikacyjne z zakresu szeregowania zadań.
-
On the complexity of distributed greedy coloring
PublikacjaW pracy rozważono problem kolorowania grafów przy dodatkowym założeniu, że kolor żadnego wierzchołka nie może zostać zmniejszony bez zmiany kolorów przynajmniej jednego z jego sąsiadów. Przeprowadzone rozważania dotyczyły złożoności obiczeniowej problemu w modelu Liniala obliczeń rozproszonych. Podano ograniczenia dolne i górne złożoności problemu oraz zestawiono problem z innymi pokrewnymi zagadnieniami grafowymi.
-
On-line P-coloring of graphs
PublikacjaFor a given induced hereditary property P, a P-coloring of a graph G is an assignment of one color to each vertex such that the subgraphs induced by each of the color classes have property P. We consider the effectiveness of on-line P-coloring algorithms and give the generalizations and extensions of selected results known for on-line proper coloring algorithms. We prove a linear lower bound for the performance guarantee function...
-
2-Coloring number revisited
Publikacja2-Coloring number is a parameter, which is often used in the literature to bound the game chromatic number and other related parameters. However, this parameter has not been precisely studied before. In this paper we aim to fill this gap. In particular we show that the approximation of the game chromatic number by the 2-coloring number can be very poor for many graphs. Additionally we prove that the 2-coloring number may grow...
-
Interval edge-coloring of graphs.
PublikacjaRozdział poświęcony prezentacji modelu zwartego kolorowania krawędziowego grafów i jego znanych własności. Szczególny nacisk położono na opis klas grafów dających się pokolorować zwarcie w czasie wielomianowym. Omówiono także stratność jako miarę niepodatności grafu na kolorowanie zwarte.
-
Path Coloring and Routing in Graphs.
PublikacjaW rozdziale omówione zostały problemy kolorowania ścieżek i routingu w grafach. Podano podstawowe definicje związane z tymi problemami, znane wyniki wraz z dyskusją złożoności obliczeniowej dla grafów ogólnych i dla kilku podstawowych klas grafów oraz zastosowania.
-
Equitable vertex coloring of graphs
PublikacjaW pracy podajemy wartości sprawiedliwej liczby chromatycznej dla niektórych klas grafów. Podajemy również dwa algorytmy heurystyczne dla sprawiedliwego kolorowania grafów z suboptymalna liczba koloru.
-
Influence of Honing Parameters on the Quality of the Machined Parts and Innovations in Honing Processes
PublikacjaThe article presents a literature review dealing with the effect of the honing parameters on the quality of the machined parts, as well as with the recent innovations in honing processes. First, an overview about the honing and the plateau-honing processes is presented, considering the main parameters that can be varied during machining. Then, the influence of the honing parameters on surface finish, shape deviation and material...
-
A common nonsense mutation of the BLM gene and prostate cancer risk and survival
Publikacja -
First recurrent large genomic rearrangement in the BRCA1 gene found in Poland
Publikacja -
Robustness of Pathway Enrichment Analysis to Transcriptome-Wide Gene Expression Platform
Publikacja -
Statistical Integration of p-values for Enhancing Discovery of Radiotoxicity Gene Signatures
Publikacja -
Iron overload and HFE gene mutations in Polish patients with liver cirrhosis
Publikacja -
K-ras gene mutation as an early prognostic marker of colon cancer
Publikacja -
Stability of delay induced oscillations in gene expression of Hes1 protein model
PublikacjaW pracy prezentowana jest matematyczna analiza modelu ekspresji genu białka Hes1. Rozważamy układ równań z dwoma opóźnieniami - w produkcji białka Hes1 oraz jego mRNA. Dowodzimy istnienia i jednoznaczności oraz nieujemności rozwiązań. Pokazujemy istnienie dokładnie jednego dodatniego stanu stacjonarnego. Wykazujemy, że stabilność stanu stacjonarnego zależy od sumy opóźnień. Podajemy warunek dostateczny na wystąpienie bifurkacji...
-
Expression of alternatively spliced variants of the Dclk1 gene is regulated by psychotropic drugs
Publikacja -
Adverse Childhood Experiences and Methylation of the FKBP5 Gene in Patients with Psychotic Disorders
Publikacja -
Vitamin D Metabolism Gene Polymorphisms and Their Associated Disorders: A Literature Review
Publikacja -
Clinical presentation of Y189C mutation of the NOTCH3 gene in the Polish family with CADASIL
Publikacja -
HPV16 E6 Gene Transcripts in Primary Type II Endometrial Carcinomas
Publikacja -
Transcriptomic responses to wounding: meta-analysis of gene expression microarray data
PublikacjaBackground A vast amount of microarray data on transcriptomic response to injury has been collected so far. We designed the analysis in order to identify the genes displaying significant changes in expression after wounding in different organisms and tissues. This meta-analysis is the first study to compare gene expression profiles in response to wounding in as different tissues as heart, liver, skin, bones, and spinal cord, and...
-
Mathematical analysis of a generalised p53-Mdm2 protein gene expression model
PublikacjaWe propose the generalisation of the p53-Mdm2 protein gene expression model introduced by Monk (2003). We investigate the stability of a unique positive steady state and formulate conditions which guarantee the occurrence of the Hopf bifurcation. We show that oscillatory behaviour can be caused not only by time lag in protein transcription process, but also can be present in the model without time delay. Moreover, we investigate...
-
Effect of Sieve Drum Inclination Angle on Wheat Grain Cleaning in a Novel Rotary Cleaning Device
Publikacja -
Analysis of the Sieve Unit Inclination Angle in the Cleaning Process of Oat Grain in a Rotary Cleaning Device
Publikacja -
Appraisal of a hybrid air cleaning process
Publikacja -
The Backbone Coloring Problem for Bipartite Backbones
PublikacjaLet G be a simple graph, H be its spanning subgraph and λ≥2 be an integer. By a λ -backbone coloring of G with backbone H we mean any function c that assigns positive integers to vertices of G in such a way that |c(u)−c(v)|≥1 for each edge uv∈E(G) and |c(u)−c(v)|≥λ for each edge uv∈E(H) . The λ -backbone chromatic number BBCλ(G,H) is the smallest integer k such that there exists a λ -backbone coloring c of G with backbone H satisfying...
-
Interval incidence coloring of bipartite graphs
PublikacjaIn this paper we study the problem of interval incidence coloring of bipartite graphs. We show the upper bound for interval incidence coloring number (χii) for bipartite graphs χii≤2Δ, and we prove that χii=2Δ holds for regular bipartite graphs. We solve this problem for subcubic bipartite graphs, i.e. we fully characterize the subcubic graphs that admit 4, 5 or 6 coloring, and we construct a linear time exact algorithm for subcubic...
-
Equitable coloring of corona products of graphs
PublikacjaIn this paper we consider an equitable coloring of some corona products of graphs G and H in symbols, G o H). In particular, we show that deciding the colorability of G o H is NP-complete even if G is 4-regular and H is K_2. Next, we prove exact values or upper bounds on the equitable chromatic number of G o H, where G is an equitably 3- or 4-colorable graph and H is an r-partite graph, a path, a cycle or a complete graph.
-
Parallel immune system for graph coloring
PublikacjaThis paper presents a parallel artificial immune system designed forgraph coloring. The algorithm is based on the clonal selection principle. Each processor operates on its own pool of antibodies and amigration mechanism is used to allow processors to exchange information. Experimental results show that migration improves the performance of the algorithm. The experiments were performed using a high performance cluster on a set...
-
The new concept of product. Cooling band
PublikacjaThe chapter below presents the innovative solution consist in applying the cooling band to help holding the hot object. The solution was found through substitute inputs analysis and brain storm method. The new product was submitted in Polish Patent Office under the No. W.120905.
-
The Backbone Coloring Problem for Small Graphs
PublikacjaIn this paper we investigate the values of the backbone chromatic number, derived from a mathematical model for the problem of minimization of bandwidth in radio networks, for small connected graphs and connected backbones (up to 7 vertices). We study the relationship of this parameter with the structure of the graph and compare the results with the solutions obtained using the classical graph coloring algorithms (LF, IS), modified...
-
The complexity of equitable vertex coloring graphs
PublikacjaW artykule podajemy wzory na sprawiedliwą liczbę chromatyczną niektórych produktów grafowych. Ponadto przedstawiamy dwa algorytmy wielomianowe dla sprawiedliwego kolorowania grafów suboptymalną liczba kolorów.
-
Modelling of pipes conveying flowing liquid
PublikacjaThe paper introduces the method of modal reduction of system which consists of pipe with flowing liquid. The concept of hybrid model is proposed. The system model consists of two parts, the modal model and the finite elements model. The modal model represents linear, self-adjoined part of the system, while simple lumped technique is applied for modelling of Coriolis phenomena.
-
Edge-coloring of 3-uniform hypergraphs
PublikacjaWe consider edge-colorings of 3-uniform hypergraphs which is a natural generalization of the problem of edge-colorings of graphs. Various classes of hypergraphs are discussed and we make some initial steps to establish the border between polynomial and NP-complete cases. Unfortunately, the problem appears to be computationally difficult even for relatively simple classes of hypergraphs.
-
Dynamic F-free Coloring of Graphs
PublikacjaA problem of graph F-free coloring consists in partitioning the vertex set of a graph such that none of the resulting sets induces a graph containing a fixed graph F as an induced subgraph. In this paper we consider dynamic F-free coloring in which, similarly as in online coloring, the graph to be colored is not known in advance; it is gradually revealed to the coloring algorithm that has to color each vertex upon request as well...
-
Equitable coloring of corona multiproducts of graphs
PublikacjaWe give some results regarding the equitable chromatic number for l-corona product of two graphs: G and H, where G is an equitably 3- or 4-colorable graph and H is an r-partite graph, a cycle or a complete graph. Our proofs lead to polynomial algorithms for equitable coloring of such graph products provided that there is given an equitable coloring of G.
-
Interval incidence coloring of subcubic graphs
PublikacjaIn this paper we study the problem of interval incidence coloring of subcubic graphs. In [14] the authors proved that the interval incidence 4-coloring problem is polynomially solvable and the interval incidence 5-coloring problem is N P-complete, and they asked if χii(G) ≤ 2∆(G) holds for an arbitrary graph G. In this paper, we prove that an interval incidence 6-coloring always exists for any subcubic graph G with ∆(G) = 3.
-
On greedy graph coloring in the distributed model
PublikacjaArtykuł traktuje o zachłannym kolorowaniu grafów w modelu rozproszonym. Zaprezentowano nowy probabilistyczny algorytm dający w wyniku pokolorowanie LF. Udowodniono, że jakakolwiek rozproszona implementacja LF wymaga co najmniej D rund, gdzie D jest maksymalnym stopniem wierzchołka w grafie.
-
Simulation of the Opening and Closing of Hsp70 Chaperones by Coarse-Grained Molecular Dynamics
Publikacja -
Detection of Closing Crack in Beam Based on Responses Induced by Harmonic Excitation
PublikacjaThe non-linear contact model was chosen to simulate the closed crack in the cantilever beam. The study examines the shape and characteristics of the phase diagram of a cantilever beam with closed cracks. It investigates how various crack properties influence the geometry of the phase diagram and proposes a method for identifying cracks based on their features. The area of each closed curve in the phase diagram is determined using...