We define two two-variable polynomials for rooted trees and one twovariable polynomial for unrooted trees, all of which are based on the coranknullity formulation of the Tutte polynomial of a graph or matroid. For the rooted polynomials, we show that the polynomial completely determines the rooted tree, i.e., rooted trees TI and T, are isomorphic if and only if f(T,) = f(T2). The corresponding ...

We describe a novel and potentially important tool for candidate subunit vaccine selection through in silico reverse-vaccinology. A set of Bayesian networks able to make individual predictions for specific subcellular locations is implemented in three pipelines with different architectures: a parallel implementation with a confidence level-based decision engine and two serial implementations wi...

We examine some properties of the 2-variable greedoid polynomial f(G;t, z) when G is the branching greedoid associated to a rooted graph or a rooted directed graph. For rooted digraphs, we show a factoring property of f (G;t ,z) determines whether or not the rooted digraph has a directed cycle.

One of the features inherent in nested Archimedean copulas, also called hierarchical Archimedean copulas, is their rooted tree structure. In this paper, a nonparametric, rank-based method to estimate this structure is developed. Our approach consists in representing the rooted tree structure as a set of trivariate structures that can be estimated individually. Indeed, for any triple of variable...