4 citations · 10 across the 10 of their papers we have counts for
14 papers
Defining a phylogenetic tree with the minimum number of small-state characters
Yangjing Long, Tong Wang
Phylogenetic trees represent evolutionary relationships and can be uniquely defined by sets of finite-state biological characteristics. Despite prior work showing that sufficiently…
Exact--Relation Graphs
Yangjing Long, Peter F. Stadler
Pairwise compatibility graphs (PCGs) with non-negative integer edge weights recently have been used to describe rare evolutionary events and scenarios with horizontal gene transfer…
Unrooted non-binary tree-based phylogenetic networks
Mareike Fischer, Michelle Galla, Lina Herbst +2
Phylogenetic networks are a generalization of phylogenetic trees allowing for the representation of non-treelike evolutionary events such as hybridization. Typically, such networks…
Classes of treebased networks
Mareike Fischer, Michelle Galla, Lina Herbst +2
Recently, so-called treebased phylogenetic networks have gained considerable interest in the literature, where a treebased network is a network that can be constructed from a phylo…
Phylogenetic trees and homomorphisms
Yangjing Long
In Chapter 1 we fully characterise pairs of finite graphs which form a gap in the full homomorphism order. This leads to a simple proof of the existence of generalised duality pair…
A Short Note on Undirected Fitch Graphs
Manuela Geiß, Marc Hellmuth, Yangjing Long +1
The symmetric version of Fitch's xenology relation coincides with class of complete multipartite graph and thus cannot convey any non-trivial phylogenetic information.
Word-representability of split graphs
Sergey Kitaev, Yangjing Long, Jun Ma +1
Letters and alternate in a word if after deleting in all letters but the copies of and we either obtain a word (of even or odd length) or a wor…
Gaps in full homomorphism order
Jiří Fiala, Jan Hubička, Yangjing Long
We characterise gaps in the full homomorphism order of graphs.
Reconstructing unrooted phylogenetic trees from symbolic ternary metrics
Stefan Grünewald, Yangjing Long, Yaokun Wu
In 1998, Böcker and Dress gave a 1-to-1 correspondence between symbolically dated rooted trees and symbolic ultrametrics. We consider the corresponding problem for unrooted trees.…
Inference of Phylogenetic Trees from the Knowledge of Rare Evolutionary Events
Marc Hellmuth, Maribel Hernandez-Rosales, Yangjing Long +1
Rare events have played an increasing role in molecular phylogenetics as potentially homoplasy-poor characters.In this contribution we analyze the phylogenetic information content…
Fractal property of the graph homomorphism order
Jiří Fiala, Jan Hubička, Yangjing Long +1
We show that every interval in the homomorphism order of finite undirected graphs is either universal or a gap. Together with density and universality this "fractal" property contr…
Graph Relations and Constrained Homomorphism Partial Orders
Yangjing Long
We consider constrained variants of graph homomorphisms such as embeddings, monomorphisms, full homomorphisms, surjective homomorpshims, and locally constrained homomorphisms. We a…
Universality of intervals of line graph order
Jiří Fiala, Jan Hubička, Yangjing Long
We prove that for every the homomorphism order of the class of line graphs of finite graphs with maximal degree is universal. This means that every finite or countabl…
Relations Between Graphs
Jan Hubicka, Jürgen Jost, Yangjing Long +2
Given two graphs G and H, we ask under which conditions there is a relation R that generates the edges of H given the structure of graph G. This construction can be seen as a form…