Factorization and pseudofactorization of weighted graphs
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 …
decompositions of G into Cartesian products of smaller graphs. When G is isomorphic to a …
Binary Stretch Embedding of Weighted Graphs
JB Ebrahimi, MO Bonab - arXiv preprint arXiv:2403.09311, 2024 - arxiv.org
In this paper, we introduce and study the problem of\textit {binary stretch embedding} of
edge-weighted graph. This problem is closely related to the well-known\textit {addressing …
edge-weighted graph. This problem is closely related to the well-known\textit {addressing …
Rational Design of DNA Sequences with Non-Orthogonal Binding Interactions
JD Berleant - 29th International Conference on DNA Computing …, 2023 - drops.dagstuhl.de
Molecular computation involving promiscuous, or non-orthogonal, binding interactions
between system components is found commonly in natural biological systems, as well as …
between system components is found commonly in natural biological systems, as well as …
Beyond trees: the metric geometry of subsets of weighted Hamming cubes
Associated to any finite metric space are a large number of objects and quantities which
provide some degree of structural or geometric information about the space. In this paper we …
provide some degree of structural or geometric information about the space. In this paper we …