English
Related papers

Related papers: Modules and PQ-trees in Robinson spaces

200 papers

A Robinson space is a dissimilarity space $(X,d)$ (i.e., a set $X$ of size $n$ and a dissimilarity $d$ on $X$) for which there exists a total order $<$ on $X$ such that $x<y<z$ implies that $d(x,z)\ge \max\{ d(x,y), d(y,z)\}$. Recognizing…

Discrete Mathematics · Computer Science 2023-01-31 Mikhael Carmona , Victor Chepoi , Guyslain Naves , Pascal Préa

Robinson spaces are structures equipped with a total order that encodes comparative dissimilarity relationships. We study the problem of representing Robinson dissimilarity spaces into low-dimensional metric spaces. These representations…

Combinatorics · Mathematics 2026-02-25 Francisco Arrepol , Mauricio Soto-Gomez , Christopher Thraves Caro

Understanding the mutational history of tumor cells is a critical endeavor in unraveling the mechanisms underlying cancer. Since the modeling of tumor cell evolution employs labeled trees, researchers are motivated to develop different…

Populations and Evolution · Quantitative Biology 2023-11-17 Elahe Khayatian , Gabriel Valiente , Louxin Zhang

In this work, we extend the concept of Robinson spaces to asymmetric dissimilarities, enhancing their applicability in representing and analyzing complex data. Within this generalized framework, we introduce two different problems that…

Discrete Mathematics · Computer Science 2024-12-06 Francois Brucker , Pascal Préa , Christopher Thraves Caro

To every Poisson algebraic variety X over an algebraically closed field of characteristic zero, we canonically attach a right D-module M(X) on X. If X is affine, solutions of M(X) in the space of algebraic distributions on X are Poisson…

Symplectic Geometry · Mathematics 2010-12-24 Pavel Etingof , Travis Schedler , Ivan Losev

The tree metric theorem provides a combinatorial four point condition that characterizes dissimilarity maps derived from pairwise compatible split systems. A similar (but weaker) four point condition characterizes dissimilarity maps derived…

Combinatorics · Mathematics 2011-10-24 Aaron Kleinman , Matan Harel , Lior Pachter

PQ-trees and PC-trees are data structures that represent sets of linear and circular orders, respectively, subject to constraints that specific subsets of elements have to be consecutive. While equivalent to each other, PC-trees are…

Data Structures and Algorithms · Computer Science 2021-06-29 Simon D. Fink , Matthias Pfretzschner , Ignaz Rutter

There are several tools available to infer phylogenetic trees, which depict the evolutionary relationships among biological entities such as viral and bacterial strains in infectious outbreaks, or cancerous cells in tumor progression trees.…

Data Structures and Algorithms · Computer Science 2023-12-22 António Pedro Branco , Cátia Vaz , Alexandre P. Francisco

A rooted tree module (RTM) $M:=M(T,F)$ over a zero-relation algebra $\Lambda:=\mathcal KQ/\langle\rho\rangle$ over a field $\mathcal K$ is given by the data of a quiver morphism $F:T\to Q$ from a rooted tree $T$ (either with a source or a…

Representation Theory · Mathematics 2025-08-12 Suraj Mishra , Amit Kuber

The Robinson-Foulds (RF) metric is arguably the most widely used measure of phylogenetic tree similarity, despite its well-known shortcomings: For example, moving a single taxon in a tree can result in a tree that has maximum distance to…

Data Structures and Algorithms · Computer Science 2013-08-02 Sebastian Böcker , Stefan Canzar , Gunnar W. Klau

It is known that PQ-symmetric maps on the boundary characterize the quasi-isometry type of visual hyperbolic spaces, in particular, of geodesically complete \br-trees. We define a map on pairs of PQ-symmetric ultrametric spaces which…

Geometric Topology · Mathematics 2010-02-08 Álvaro Martínez-Pérez

The Robinson-Foulds (RF) distance is by far the most widely used measure of dissimilarity between trees. Although the distribution of these distances has been investigated for twenty years, an algorithm that is explicitly polynomial time…

Populations and Evolution · Quantitative Biology 2008-10-07 David Bryant , Mike Steel

Low dimensional and computationally less expensive Reduced-Order Models (ROMs) have been widely used to capture the dominant behaviors of high-dimensional systems. A ROM can be obtained, using the well-known Proper Orthogonal Decomposition…

Applications · Statistics 2022-06-24 Xiao Liu , Xinchao Liu

An ultrametric space or infinity-metric space is defined by a dissimilarity function that satisfies a strong triangle inequality in which every side of a triangle is not larger than the larger of the other two. We show that search in…

Information Retrieval · Computer Science 2026-02-10 Antonio Pariente , Ignacio Hounie , Santiago Segarra , Alejandro Ribeiro

We survey the theory of Poisson traces (or zeroth Poisson homology) developed by the authors in a series of recent papers. The goal is to understand this subtle invariant of (singular) Poisson varieties, conditions for it to be…

Algebraic Geometry · Mathematics 2017-11-15 Pavel Etingof , Travis Schedler

Semidirected networks have received interest in evolutionary biology as the appropriate generalization of unrooted trees to networks, in which some but not all edges are directed. Yet these networks lack proper theoretical study. We define…

Combinatorics · Mathematics 2024-10-14 Michael Maxfield , Jingcheng Xu , Cécile Ané

For the rational, elliptic and trigonometric r-matrices, we exhibit the links between three "levels" of Poisson spaces: (a) Some finite-dimensional spaces of matrix-valued holomorphic functions on the complex line; (b) Spaces of spectral…

Mathematical Physics · Physics 2009-01-22 J. Harnad , J. C. Hurtubise

A Lorentzian manifold is defined here as a smooth pseudo-Riemannian manifold with a metric tensor of signature ((2n +1, 1)). A Robinson manifold is a Lorentzian manifold (M) of dimension (\geqslant 4) with a subbundle (N) of the…

Differential Geometry · Mathematics 2007-05-23 Pawel Nurowski , Andrzej Trautman

In this paper, we present a factor 16 approximation algorithm for the following NP-hard distance fitting problem: given a finite set X and a distance d on X, find a Robinsonian distance dR on X minimizing the l\infty-error ||d - dR||\infty…

Data Structures and Algorithms · Computer Science 2009-02-10 Victor Chepoi , M. Seston

An SPQR-tree is a data structure that efficiently represents all planar embeddings of a biconnected planar graph. It is a key tool in a number of constrained planarity testing algorithms, which seek a planar embedding of a graph subject to…

Data Structures and Algorithms · Computer Science 2020-09-28 Guido Brückner , Ignaz Rutter
‹ Prev 1 2 3 10 Next ›