Results 91 to 100 of about 2,126 (197)

Incomplete lineage sorting and hybridization as sources of gene tree discordance among species of the Geminata clade of Solanum (Solanaceae)

TAXON, Volume 75, Issue 2, April 2026.
Abstract Discordance among gene trees, including discrepancies with the species tree, is increasingly reported in analyses of phylogenomic data. Such discordance can result from technical issues such as misalignment, paralogy, or model misfit, or from biological processes such as incomplete lineage sorting (ILS), hybridization with introgression, or ...
Juan David Tovar, Edeline Gagnon, Sandra Knapp, Thiago André, Clarisse Palma‐Silva, Lynn Bohs, Leandro Lacerda Giacomin   +6 more
wiley   +1 more source

Reliable Inference of Phylogenomic Relationship via Assembly‐Based Strategy Accommodating Raw Reads and Proteins

Molecular Ecology Resources, Volume 26, Issue 3, April 2026.
ABSTRACT Phylogenomics is a transformative approach in systematics, conservation biology, and biomedical research, enabling the inference of evolutionary relationships by leveraging hundreds to thousands of genes from genomic or transcriptomic data. However, acquiring high‐quality genomes and transcriptomes necessitates samples with intact DNA and RNA,
Yunlong Li, Xu Liu, Chong Chen, Jian‐Wen Qiu, Kevin M. Kocot, Jin Sun   +5 more
wiley   +1 more source

Left-deep join order selection with higher-order unconstrained binary optimization on quantum computers

Frontiers in Computer Science
Join order optimization is among the most crucial query optimization problems, and its central position is also evident in the new research field where quantum computing is applied to database optimization and data management.
Valter Uotila
doaj   +1 more source

Understanding the 2024 Summer Riots in the UK: Three Case Studies

Journal of Community &Applied Social Psychology, Volume 36, Issue 2, March/April 2026.
ABSTRACT The wave of riots in England in summer 2024 constituted the biggest wave of disorder in the country for more than a decade. These were followed by swift policy responses, based on assumptions about the events and the participants, before any detailed empirical investigation had been carried out.
John Drury, Roger Ball, Julius Cesar Alejandre, Niamh Hart, Katherine R. K. Saunders, Yasemin Gülsüm Acar, Linda Bauld, Dominic Cox, Sharon Cox, Carina Hoerst, Mike Hope, Susan Michie, Fergus Neville, Evangelos Ntontis, Matt Radburn, Stephen Reicher, Clifford Stott, Anne Templeton, Sara Vestergren, Rosie Wild   +19 more
wiley   +1 more source

Clique-Based Lower Bounds for Parsing Tree-Adjoining Grammars

, 2017
Tree-adjoining grammars are a generalization of context-free grammars that are well suited to model human languages and are thus popular in computational linguistics. In the tree-adjoining grammar recognition problem, given a grammar $ $ and a string $s$ of length $n$, the task is to decide whether $s$ can be obtained from $ $.
Bringmann, Karl, Wellnitz, Philip
openaire   +7 more sources

Clique coloring EPT graphs on bounded degree trees

Revista de la Unión Matemática Argentina
Summary: The edge-intersection graph of a family of paths on a host tree is called an EPT graph. When the host tree has maximum degree \(h\), we say that the graph is \([h,2,2]\). If the host tree also satisfies being a star, we have the corresponding classes of EPT-star and \([h,2,2]\)-star graphs.
de Caria, Pablo Jesús, Mazzoleni, María Pía, Payo Vidal, María Guadalupe   +2 more
openaire   +3 more sources

Subset‐Row Inequalities and Unreachability in Path‐Based Formulations for Vehicle Routing and Scheduling Problems

Networks, Volume 87, Issue 2, Page 111-130, March 2026.
ABSTRACT This work considers branch‐price‐and‐cut algorithms for variants of the vehicle‐routing problem in which subset‐row inequalities (SRIs) are used to strengthen the linear relaxation. SRIs often help to substantially reduce the size of the branch‐and‐bound search tree.
Stefan Faldum, Timo Gschwind, Stefan Irnich   +2 more
wiley   +1 more source

Parity Games of Bounded Tree- and Clique-Width [PDF]

, 2015
In this paper it is shown that deciding the winner of a parity game is in LogCFL, if the underlying graph has bounded tree-width, and in LogDCFL, if the tree-width is at most 2. It is also proven that parity games of bounded clique-width can be solved in LogCFL via a log-space reduction to the bounded tree-width case, assuming that a k-expression for ...
openaire   +1 more source

Unraveling cryptic lineages in Jatropha nana: phylogenetic evidence supports species status for J. benghalensis (Euphorbiaceae)

Nordic Journal of Botany, Volume 2026, Issue 3, March 2026.
The taxonomic framework of the genus Jatropha (Euphorbiaceae) is well established, but its geophytic species present significant classification challenges. These difficulties arise from species complexes, cryptic traits, and high environmental and phenotypic variability.
Seema, Varnika Bhatia, Senthilkumar Umapathy   +2 more
wiley   +1 more source

Cognitive Networks for Knowledge Modeling: A Gentle Introduction for Data‐ and Cognitive Scientists

WIREs Cognitive Science, Volume 17, Issue 2, March/April 2026.
Cognitive network science helps organize associative knowledge—that is, the connections between concepts. These connections play a key role in cognitive processes such as language understanding and context interpretation, even though they are not obvious in language use.
Edith Haim, Massimo Stella
wiley   +1 more source