A lattice structure for ancestral configurations arising from the relationship between gene trees and species trees [0.03%]
谱系配置的格结构源于基因树和物种树之间的关系
Egor Lappo,Noah A Rosenberg
Egor Lappo
To a given gene tree topology G and species tree topology S with leaves labeled bijectively from a fixed set X, one can associate a set of ancestral configurations, each of which encodes a set of gene lineages that can be found at a given n...
Joseph Berleant,Kristin Sheridan,Anne Condon et al.
Joseph Berleant et al.
A mapping α:V(G)→V(H) from the vertex set of one graph G to another graph H is an isometric embedding if the shortest path distance between any two vertices in G equals the distance between their images in H. Here, we consider is...
Kristin Sheridan,Joseph Berleant,Mark Bathe et al.
Kristin Sheridan et al.
For unweighted graphs, finding isometric embeddings of a graph G is closely related to decompositions of G into Cartesian products of smaller graphs. When G is isomorphic to a Cartesian graph product, we call the factors of this product a f...
On Ramsey and star-critical Ramsey numbers for generalized fans versus nK m [0.03%]
关于广义扇和nKm的Ramsey及星临界Ramsey数问题
Arran Hamm,Paul Hazelton,Suzanna Thompson
Arran Hamm
In this paper, we determine the Ramsey number and star-critical Ramsey number, under certain restrictions on the relevant parameters, for nKm versus K 1 + tH where t ≥ 2 and H is an arbitrary graph. ...
On the Colijn-Plazzotta numbering scheme for unlabeled binary rooted trees [0.03%]
关于未标记二叉根树的Colijn-Plazzotta编号方案
Noah A Rosenberg
Noah A Rosenberg
Colijn & Plazzotta (Syst. Biol. 67:113-126, 2018) introduced a scheme for bijectively associating the unlabeled binary rooted trees with the positive integers. First, the rank 1 is associated with the 1-leaf tree. Proceeding recursively, or...
Carlile Lavor,Leo Liberti,Bruce Donald et al.
Carlile Lavor et al.
Nuclear Magnetic Resonance (NMR) experiments provide distances between nearby atoms of a protein molecule. The corresponding structure determination problem is to determine the 3D protein structure by exploiting such distances. We present a...
Ronald D Hagan,Michael A Langston,Kai Wang
Ronald D Hagan
The scientific literature teems with clique-centric clustering strategies. In this paper we analyze one such method, the paraclique algorithm. Paraclique has found practical utility in a variety of application domains, and has been successf...
Travis Hoppe,Anna Petrone
Travis Hoppe
We have exhaustively enumerated all simple, connected graphs of a finite order and have computed a selection of invariants over this set. Integer sequences were constructed from these invariants and checked against the Online Encyclopedia o...
Alexander R Griffing,Benjamin R Lynch,Eric A Stone
Alexander R Griffing
It is well known that information about the structure of a graph is contained within its minimum cut. Here we investigate how the minimum cut of one graph informs the structure of a second, related graph. We consider pairs of graphs G and H...
A set-covering based heuristic algorithm for the periodic vehicle routing problem [0.03%]
基于集合覆盖的启发式算法在周期性车辆路线问题中的研究与应用
V Cacchiani,V C Hemmelmayr,F Tricoire
V Cacchiani
We present a hybrid optimization algorithm for mixed-integer linear programming, embedding both heuristic and exact components. In order to validate it we use the periodic vehicle routing problem (PVRP) as a case study. This problem consist...