Filters
total: 2026
-
Catalog
- Publications 1619 available results
- Journals 66 available results
- Conferences 8 available results
- Publishing Houses 1 available results
- People 30 available results
- Inventions 1 available results
- Projects 4 available results
- Research Teams 2 available results
- e-Learning Courses 15 available results
- Events 4 available results
- Open Research Data 276 available results
displaying 1000 best results Help
Search results for: gene cloning
-
Gene-based identification of bacterial colonies with an electric chip
Publication -
Cognitive decline in Huntington's disease expansion gene carriers
Publication -
Phenotypic consequences of the LYS4 gene disruption in Candida albicans
PublicationThe main scientific purpose of our studies was to verify the hypothesis that homoaconitase (HA) from Candida albicans, an enzyme catalyzing a second step of the α-aminoadipate pathway (AAP) of L-Lys biosynthesis may become a new target for antifungal chemotherapy. Previous studies indicated that the A. fumigatus mutant lacking the functional lysF gene, encoding HA, exhibited attenuated virulence in a low-dose mouse infection model...
-
Intra-operative biopsy in chronic sinusitis detects pathogenic Escherichia coli that carry fimG/H, fyuA and agn43 genes coding biofilm formation
PublicationThe aim of this study was to investigate whether or not surgical biopsy of sinus tissue in chronic sinusitis, not responsive to treatment, would detect E. coli. We intended to evaluate E. coli virulence genes, therefore dispute the causal role of such an unusual microorganism in chronic sinusitis, as well as consider effective pathogen-targeted therapy. Patients with E. coli isolated by intra-operative puncture biopsy were included...
-
Magyar Zene
Journals -
GENES AND IMMUNITY
Journals -
GENES & DEVELOPMENT
Journals -
Genes & Diseases
Journals -
Genes & Genomics
Journals -
Genes and Nutrition
Journals -
Genes and Cancer
Journals -
Genes and Environment
Journals -
Genes and Cells
Journals -
Genre & Histoire
Journals -
Dynamic coloring of graphs
PublicationDynamics is an inherent feature of many real life systems so it is natural to define and investigate the properties of models that reflect their dynamic nature. Dynamic graph colorings can be naturally applied in system modeling, e.g. for scheduling threads of parallel programs, time sharing in wireless networks, session scheduling in high-speed LAN's, channel assignment in WDM optical networks as well as traffic scheduling. In...
-
Equitable coloring of hypergraphs
PublicationA hypergraph is equitablyk-colorable if its vertices can be partitioned into k sets/colorclasses in such a way that monochromatic edges are avoided and the number of verticesin any two color classes differs by at most one. We prove that the problem of equitable 2-coloring of hypergraphs is NP-complete even for 3-uniform hyperstars. Finally, we apply the method of dynamic programming for designing a polynomial-time algorithm to...
-
Rank Coloring of Graphs.
PublicationRozdział jest poświęcony uporządkowanemu kolorowaniu grafów. Przedstawiono jego podstawowe własności oraz zastosowania praktyczne.
-
T-coloring of graphs.
PublicationNiniejszy rozdział omawia kontrastowe kolorowanie grafów. Podana została jego definicja i podstawowe własności, zastosowania oraz złożoność obliczeniowa problemów rozważanych w ramach tej dziedziny.
-
Harmonions Coloring of Graphs.
PublicationProblem kolorowania grafów jest motywowany radionawigacją lotniczą, kompresją obrazów i in. W rozdziale podano podstawowe fakty dotyczące tego modelu kolorowania, a wsród nich dolne i górne oszacowania na liczbę harmoniczną i algorytm o złożoności 0 (mm3) dający bardzo dobre pokolorowania przybliżone.
-
Classical coloring of graphs.
PublicationRozdział obejmuje klasyczne kolorowanie krawędzi i wierzołków w grafach prostych. Oprócz podstawowych definicji podane zostały najczęściej stosowane metody przybliżone oraz ich właściwości. Dodatkowo rozdział zawiera przegląd znanych benczmarków dla podanych metod w kontekście klasycznego modelu kolorowania.
-
Sum Coloring of Graphs.
PublicationRozdział jest poświęcony sumacyjnemu kolorowaniu grafów. Przedstawiono jego podstawowe własności oraz zastosowania praktyczne.
-
Cloning and characterization of the dnaK heat shock operon of the marine bacterium Vibrio harveyi
Publication -
Cloning, Expression and Purification of Wild-Type Trehalose Synthase from Deinococcus geothermalis
PublicationThe aim of this study was isolation and cloning of trehalose synthase gene derived from extremophilic microorganism to the expression vectors in the Tabor-Studier system and its expression in Rosetta(DE3)pLysS Escherichia coli cells. The second phase of the study consisted of proteins purification using an initial denaturation of host proteins and salting-out proteins by ammonium sulfate.
-
Cloning, expression, purification and characterization of recombinant trehalose synthase from Deinococcus radiodurans.
PublicationTrehalose (α-D-glucopyranosyl-1,1-α-D-glucopyranoside) is a nonreducing disacharide in which the two glucose molecules are linked trough a α-1,1-glycosidic bond. Trehalose is readily hydrolyzed to glucose and can be used as a reserve of that sugar in the cell. The presence of trehalose was found in the cells of fungi and yeasts, bacteria, nematodes, insects, eggs, pupae and some plants. The characteristics of trehalose make it...
-
ArchBGal32cB 441Glu mutein gene analysis dataset
Open Research Data -
Eqiuitable coloring of corona products of cubic graphs is harder than ordinary coloring
PublicationA graph is equitably k-colorable if its vertices can be partitioned into k independent sets in such a way that the number of vertices in any two sets differ by at most one. The smallest k for which such a coloring exists is known as the equitable chromatic number of G. In this paper the problem of determinig the equitable coloring number for coronas of cubic graphs is studied. Although the problem of ordinary coloring of coronas...
-
The saga of a fish: from a survival guide to closing lemmas
PublicationIn the paper by D. Burago, S. Ivanov and A. Novikov, “A survival guide for feeble fish”, it has been shown that a fish with limited velocity can reach any point in the (possibly unbounded) ocean provided that the fluid velocity field is incompressible, bounded and has vanishing mean drift. This result extends some known global controllability theorems though being substantially nonconstructive. We give a fish a different recipe...
-
Cancer Familial Aggregation (CFA) and G446A polymorphism in ARLTS1 gene
Publication -
Reproducibility of Finding Enriched Gene Sets in Biological Data Analysis
Publication -
Ranking metrics in gene set enrichment analysis: do they matter?
Publication -
Newborn screening and gene therapy in SMA: Challenges related to vaccinations
Publication -
Vitamin D receptor gene polymorphisms in Alzheimer's disease patients
Publication -
Delay induced oscillations in gene expression of Hes1 protein model
PublicationW pracy został omówiony model produkcji białka Hes1. Stężenie Hes1 jest kontrolowane przez ujemne sprzężenie zwrotne wbudowane w białko i jego mRNA. Przeprowadzona analiza potwierdziła znane wyniki numeryczne, że oscylacje wywołane są przez opóźnienie. Pokazaliśmy również, że jeśli współczynnik Hilla jest większy niż 1, to istnieje krytyczna wartość opóźnienia, dla której ma miejsce bifurkacja Hopfa i pojawiają się rozwiązania...
-
Beta-2 adrenoreceptor gene polymorphisms and sympathetic outflow in humans
Publication -
Hopf bifurcation in time‐delayed gene expression model with dimers
PublicationWe 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
PublicationEscherichia 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...
-
Non-coding RNA
Journals -
Koala graph coloring library: an open graph coloring library for real-world applications
PublicationPomimo 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
PublicationAn 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
Publication -
Brushing with additional cleaning restrictions
PublicationIn 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
PublicationIn 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...
-
On the complexity of distributed greedy coloring
PublicationW 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.
-
Mixed graph edge coloring
PublicationW 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 efficient coloring of chordless graphs
PublicationArtykuł 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.
-
On-line P-coloring of graphs
PublicationFor 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
Publication2-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...
-
A note on mixed tree coloring
PublicationZaproponowano 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].
-
Equitable vertex coloring of graphs
PublicationW 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.
-
Interval edge-coloring of graphs.
PublicationRozdział 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.