From the 1 of 7 linked papers with an AI index.
7 papers
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…
Minimum Network Level Forced by Hardwired Cluster Data
Shilong Dai, Yangjing Long
Reticulate evolutionary events, such as hybridization, recombination, and horizontal transfer, can make a tree model inadequate. When evolutionary data are summarized as hardwired…
Constrained homomorphism orders
Jiri Fiala, Jan Hubicka, Yangjing Long
We study partial orders induced by constrained variants of finite graph homomorphisms: monomorphisms, embeddings, full homomorphisms, vertex-surjective, edge-surjective and surject…
The Quantum Homomorphism Orders are Universal
Yangjing Long
Quantum graph homomorphisms, introduced by ManÄinska and Roberson, form a natural quantum relaxation of classical graph homomorphisms. Since this relaxation may create new compara…
An Explicit Threshold for Attaining the Semple--Steel Bound with -State Characters
Peng Li, Yangjing Long
Let be the maximum, over all binary phylogenetic trees with leaves, of the minimum number of -state characters required to define the tree. Semple and Steel proved…
Exact Leaf Powers on Cycles, Ladders, Crowns, and Multipartite Block Graphs
Peng Li, Yangjing Long
Exact \(k\)-leaf powers are graphs whose edges are exactly the pairs of leaves at distance \(k\) in a tree. We prove explicit structure theorems for exact leaf powers on several re…