Results 41 to 50 of about 2,126 (197)
Partitioning the Bags of a Tree Decomposition into Cliques
, 2023 We consider a variant of treewidth that we call clique-partitioned treewidth in which each bag is partitioned into cliques. This is motivated by the recent development of FPT-algorithms based on similar parameters for various problems. With this paper, we take a first step towards computing clique-partitioned tree decompositions. Our focus lies on the
Bläsius, Thomas +2 more
openaire +6 more sources
Subpathway Analysis based on Signaling-Pathway Impact Analysis of Signaling Pathway. [PDF]
PLoS ONE, 2015 Pathway analysis is a common approach to gain insight from biological experiments. Signaling-pathway impact analysis (SPIA) is one such method and combines both the classical enrichment analysis and the actual perturbation on a given pathway.
Xianbin Li +3 more
doaj +1 more source
Detecting cryptic ghost lineage introgression in four‐taxon genomic datasets
Applications in Plant Sciences, EarlyView.Abstract Premise Hybridization and introgression are pervasive evolutionary forces that have played fundamental roles in shaping the diversity of wild and domesticated plants. Four‐taxon tests for introgression provide a reliable framework for detecting signatures of ancient introgression from genomic data, which have played an important role in ...
Evan S. Forsythe +3 more
wiley +1 more source
Path Graphs, Clique Trees, and Flowers
, 2015 An \emph{asteroidal triple} is a set of three independent vertices in a graph such that any two vertices in the set are connected by a path which avoids the neighbourhood of the third. A classical result by Lekkerkerker and Boland \cite{6} showed that interval graphs are precisely the chordal graphs that do not have asteroidal triples.
Mouatadid, Lalla, Robere, Robert
openaire +2 more sources
An Introduction to Chordal Graphs and Clique Trees [PDF]
, 1993 Clique trees and chordal graphs have carved out a niche for themselves in recent work on sparse matrix algorithms, due primarily to research questions associated with advanced computer architectures. This paper is a unified and elementary introduction to the standard characterizations of chordal graphs and clique trees.
Jean R. S. Blair, Barry Peyton
openaire +5 more sources
The Anatomical Record, EarlyView.Abstract The Aliança Formation (Jatobá Basin) represents lacustrine deposits formed in oxygenated waters that hosted a diverse fauna, including Hybodontiform sharks. Within this group, the Family Lonchidiidae comprises 11 valid genera, with Parvodus previously reported in Brazilian deposits from the Brejo Santo Formation (Araripe Basin, Late Jurassic ...
Larissa de Souza Ribeiro +1 more
wiley +1 more source
Reclaimed Homophobic Hate Speech Backfires: Desensitization and Mood Deterioration
European Journal of Social Psychology, EarlyView.ABSTRACT Reclaimed hate speech is generally seen as a positive phenomenon by minority groups and, to some degree, by majority groups. However, previous research has not examined whether it might produce harmful effects similar to traditional hate speech.
Dominik Puchała +2 more
wiley +1 more source
Interdisciplinary Medicine, EarlyView.This study develops a novel miRNA‐based framework for estimating the time since deposition of semen stains, combining small RNA sequencing with machine learning. Time‐dependent miRNA modules were identified using Mfuzz clustering and WGCNA, followed by a multi‐stage feature selection pipeline that reduced 261 candidate miRNAs to a minimal 7‐miRNA panel.
Meiming Cai +11 more
wiley +1 more source
Modelling epidemics on d-cliqued graphs
Letters in Biomathematics, 2018 Since social interactions have been shown to lead to symmetric clusters, we propose here that symmetries play a key role in epidemic modelling. Mathematical models on d-ary tree graphs were recently shown to be particularly effective for modelling ...
Laura P. Schaposnik, Anlin Zhang
doaj +1 more source
Bayesian Learning of Clique Tree Structure
, 2017 The problem of categorical data analysis in high dimensions is considered. A discussion of the fundamental difficulties of probability modeling is provided, and a solution to the derivation of high dimensional probability distributions based on Bayesian learning of clique tree decomposition is presented.
Savkli, Cetin +3 more
openaire +2 more sources