Zobrazeno 1 - 10
of 86
pro vyhledávání: '"Lladser, Manuel E."'
Autor:
Svihla, Sean S., Lladser, Manuel E.
Consider a tree $T=(V,E)$ with root $\circ$ and edge length function $\ell:E\to\mathbb{R}_+$. The phylogenetic covariance matrix of $T$ is the matrix $C$ with rows and columns indexed by $L$, the leaf set of $T$, with entries $C(i,j):=\sum_{e\in[i\we
Externí odkaz:
http://arxiv.org/abs/2405.17847
A subset of points in a metric space is said to resolve it if each point in the space is uniquely characterized by its distance to each point in the subset. In particular, resolving sets can be used to represent points in abstract metric spaces as Eu
Externí odkaz:
http://arxiv.org/abs/2405.11424
Autor:
Gorman, Evan D., Lladser, Manuel E.
Ultrametric matrices have a rich structure that is not apparent from their definition. Notably, the subclass of strictly ultrametric matrices are covariance matrices of certain weighted rooted binary trees. In applications, these matrices can be larg
Externí odkaz:
http://arxiv.org/abs/2208.09927
Autor:
Gorman, Evan D.1 (AUTHOR), Lladser, Manuel E.1 (AUTHOR) manuel.lladser@colorado.edu
Publikováno v:
PLoS Computational Biology. 5/20/2024, Vol. 20 Issue 5, p1-32. 32p.
Autor:
Ruth, Perrin E., Lladser, Manuel E.
We introduce the notion of Levenshtein graphs, an analog to Hamming graphs but using the edit distance instead of the Hamming distance; in particular, Levenshtein graphs allow for underlying strings (nodes) of different lengths. We characterize vario
Externí odkaz:
http://arxiv.org/abs/2107.06951
A graph $G=(V,E)$ with geodesic distance $d(\cdot,\cdot)$ is said to be resolved by a non-empty subset $R$ of its vertices when, for all vertices $u$ and $v$, if $d(u,r)=d(v,r)$ for each $r\in R$, then $u=v$. The metric dimension of $G$ is the cardin
Externí odkaz:
http://arxiv.org/abs/2106.14314
The metric dimension of a graph is the smallest number of nodes required to identify all other nodes based on shortest path distances uniquely. Applications of metric dimension include discovering the source of a spread in a network, canonically labe
Externí odkaz:
http://arxiv.org/abs/2104.07201
Autor:
Pearson, Antony, Lladser, Manuel E.
We describe a novel way to represent the probability distribution of a random binary string as a mixture having a maximally weighted component associated with independent (though not necessarily identically distributed) Bernoulli characters. We refer
Externí odkaz:
http://arxiv.org/abs/2004.08710
Autor:
Pearson, Antony, Lladser, Manuel E.
Data taking values on discrete sample spaces are the embodiment of modern biological research. "Omics" experiments produce millions of symbolic outcomes in the form of reads (i.e., DNA sequences of a few dozens to a few hundred nucleotides). Unfortun
Externí odkaz:
http://arxiv.org/abs/2002.05592
The minimal number of nodes required to multilaterate a network endowed with geodesic distance (i.e., to uniquely identify all nodes based on shortest path distances to the selected nodes) is called its metric dimension. This quantity is related to a
Externí odkaz:
http://arxiv.org/abs/1911.01521