Results 41 to 50 of about 9,711,328 (129)
HybSuite: An integrated pipeline for hybrid capture phylogenomics from reads to trees
Applications in Plant Sciences, Volume 14, Issue 3, May-June 2026.Abstract Premise Hybrid capture sequencing (Hyb‐Seq) is a widely used approach in phylogenomics, providing efficient access to targeted genomic regions. However, deriving high‐quality phylogenetic trees from raw sequencing reads requires extensive bioinformatics processing, which increases complexity, the risk of errors, and challenges in file ...
Yu‐Xuan Liu +8 more
wiley +1 more source
On traits matching and the modular organization of food web and occurrence networks
Journal of Animal Ecology, Volume 95, Issue 5, Page 837-850, May 2026.What mechanisms shape ecological networks? In Paraná River piscivores, species traits and abundance scaling promote modular structures. Our findings reveal how communities self‐organize and highlight the conditions needed to sustain them. Abstract Modularity and nestedness have been observed recurrently across different ecological networks, including ...
Dalmiro Borzone Mas +5 more
wiley +1 more source
Path numbers of balanced bipartite tournaments [PDF]
, 2001 A path decomposition of a digraph D is a partition of its edge set into edge disjoint simple paths. The minimal number of paths necessary to form a path decomposition is called the path number of D and denoted by pn(D). A bipartite tournament T(A,B) with
Vojislav Petrovic, Petrovic, Vojislav
core +1 more source
Partial difference sets and partially balanced weighing designs for calibration and tournaments [PDF]
, 1972 Starting from an initial block which consists of all the quadratic residues of the GF(4k + 1), all the v blocks of a partially balanced weighing design on v = 4k + 1 elements can be generated cyclically.
Suryanarayana, K.V, Chakravarti, I.M
core +1 more source
Regular embeddings of complete bipartite maps: classification and enumeration
The regular embeddings of complete bipartite graphs Kn, n in orientable surfaces are classified and enumerated, and their automorphism groups and combinatorial properties are determined.
Jones, Gareth
core +1 more source
Independent cycles and paths in bipartite balanced graphs [PDF]
, 2008 Bipartite graphs G = (L,R;E) and H = (L',R';E') are bi-placeabe if there is a bijection f:L∪R→ L'∪R' such that f(L) = L' and f(u)f(v) ∉ E' for every edge uv ∈ E.
Orchel, Beata, Wojda, A.
core +1 more source
, 2018 <p>Bipartite Network Analysis</p> <p>The Bipartite Network analysis app was created with Shiny and Bipartite package for R. The app was made to visualise a bipartite network and generate nestedness indices for student projects.</p ...
Greenville, A.C. (8145069) +1 more
core +1 more source
Diagonal Forms, Linear Algebraic Methods and Ramsey-Type Problems [PDF]
, 2013 This thesis focuses mainly on linear algebraic aspects of combinatorics. Let N_t(H) be an incidence matrix with edges versus all subhypergraphs of a complete hypergraph that are isomorphic to H. Richard M.
Wong, Wing Hong Tony
core +1 more source
Optimum chemical balance weighing designs with diagonal variance-covariance matrix of errors [PDF]
, 2004 In this paper we study the estimation problem of individual measurements (weights) of objects in a model of chemical balance weighing design with diagonal variance - covariance matrix of errors under the restriction k₁ + k₂ < p, where k₁ and k₂ represent
Ceranka, Bronisław +1 more
core +1 more source
Regular A-optimal design matrices X=(x ij ) with x ij =−1, 0, 1
A-optimal design, Balanced bipartite weighing design,
Małgorzata Graczyk
core +1 more source