From the 2 of 14 linked papers with an AI index.
14 papers
Is the Aharonov-Casher phase geometrical or dynamical?
Igor Kuzmenko, Y. B. Band, Yshai Avishai
We consider two two-dimensional (2D) electronic systems in the presence of a perpendicular homogeneous electric field that generates a Rashba spin-orbit interaction (RSOI): a syste…
On Tree-Network Distinguishability and Full Identifiability of Phylogenetic Networks
Jari Brits, Niels Holtgrefe, Leo van Iersel +1
The paper proves that the topology of level‑1 phylogenetic networks can be uniquely recovered from leaf‑pattern distributions under common nucleotide substitution models, and that…
Proximity Measures for Classes of Phylogenetic Networks
Leo van Iersel, Mark Jones, Esther Julien +2
The paper defines and analyzes proximity measures that quantify how many graph modifications are needed to convert a phylogenetic network into a member of specific network classes…
A kernel for the maximum agreement forest problem on multiple binary phylogenetic trees
Steven Kelk, Ruben Meuwese, Leo van Iersel
The maximum agreement forest (MAF) problem in phylogenetics takes as input a set t >= 2 of binary phylogenetic trees T on the same set of taxa X. It asks for a partition of X into…
Tree Containment Parameterized by Scanwidth
Leo van Iersel, Mark Jones, Mathias Weller
TREE CONTAINMENT is a central decision problem in mathematical phylogenetics, asking whether a given rooted phylogenetic tree is embeddable in ("displayed by") a given rooted phylo…
Average-Tree Phylogenetic Diversity Parameterized by Scanwidth and Invisibility
Leo van Iersel, Mark Jones, Jannik Schestag +2
We investigate parameterized algorithms for computing the average-tree phylogenetic diversity (APD) in rooted phylogenetic networks, studying the problem under different structural…