Results 91 to 100 of about 901,024 (319)
A fuzzy irregular cellular automata-based method for the vertex colouring problem
Vertex colouring is among the most important problems in graph theory which has been widely applied across different real-world problems. In vertex colouring problem (VCP), the goal is to assign a distinct colour to each vertex of the graph in such a way
Mostafa Kashani +2 more
doaj +1 more source
CRISPRI‐mediated gene silencing and phenotypic exploration in nontuberculous mycobacteria. In this Research Protocol, we describe approaches to control, monitor, and quantitatively assess CRISPRI‐mediated gene silencing in M. smegmatis and M. abscessus model organisms.
Vanessa Point +7 more
wiley +1 more source
Oriented Incidence Colourings of Digraphs
Brualdi and Quinn Massey [6] defined incidence colouring while study- ing the strong edge chromatic index of bipartite graphs. Here we introduce a similar concept for digraphs and define the oriented incidence chromatic number.
Duffy Christopher +3 more
doaj +1 more source
dUTPases are involved in balancing the appropriate nucleotide pools. We showed that dUTPase is essential for normal development in zebrafish. The different zebrafish genomes contain several single‐nucleotide variations (SNPs) of the dut gene. One of the dUTPase variants displayed drastically lower protein stability and catalytic efficiency as compared ...
Viktória Perey‐Simon +6 more
wiley +1 more source
Chronological and Spatial Distribution of Skeletal Muscle Fat Replacement in FHL1‐Related Myopathies
ABSTRACT Objectives Variants in the FHL1 gene cause FHL1‐related myopathies (FHL1‐RMs), a group of neuromuscular disorders with diverse clinical presentations. This study aimed to comprehensively characterize the spatial and temporal patterns of skeletal muscle fat replacement throughout the whole body in FHL1‐RMs, to examine disease progression over ...
Rui Shimazaki +8 more
wiley +1 more source
We study semirandom k-colourable graphs made up as follows. Partition the vertex set V = {1, . . ., n} randomly into k classes V1, . . ., Vk of equal size and include each Vi–Vj-edge with probability p independently (1 ≤ i < j ≤ k) to obtain a graph G0.
openaire +2 more sources
Functional Connectivity Linked to Cognitive Recovery After Minor Stroke
ABSTRACT Objective Patients with minor stroke exhibit slowed processing speed and generalized alterations in functional connectivity involving frontoparietal cortex (FPC). The pattern of connectivity evolves over time. In this study, we examine the relationship of functional connectivity patterns to cognitive performance, to determine ...
Vrishab Commuri +7 more
wiley +1 more source
Acyclic 6-Colouring of Graphs with Maximum Degree 5 and Small Maximum Average Degree
A k-colouring of a graph G is a mapping c from the set of vertices of G to the set {1, . . . , k} of colours such that adjacent vertices receive distinct colours.
Fiedorowicz Anna
doaj +1 more source
Allocating resources based on a model of coarse-grained reconfigurable architecture
Reconfigurable resource utilisation is a key factor that impacts the performance of reconfigurable instruction set processors (RISPs), which can customise their instruction set for special applications.
Huizhen Zhang +3 more
doaj +1 more source
Whole‐Body Pattern of Muscle Degeneration and Progression in Sarcoglycanopathies
ABSTRACT Objective To characterize whole‐body intramuscular fat distribution pattern in patients with sarcoglycanopathies and explore correlations with disease severity, duration and age at onset. Methods Retrospective, cross‐sectional, multicentric study enrolling patients with variants in one of the four sarcoglycan genes who underwent whole‐body ...
Laura Costa‐Comellas +39 more
wiley +1 more source

