English
Related papers

Related papers: A scale-free method for testing the proportionalit…

200 papers

Staged trees are a recently-developed, powerful family of probabilistic graphical models. An equivalence class of staged trees has now been characterised, and two fundamental statistical operators have been defined to traverse the…

Methodology · Statistics 2023-01-18 Conor Hughes , Peter Strong , Aditi Shenvi

Phylogenetic trees and networks are leaf-labelled graphs used to model evolution. Display graphs are created by identifying common leaf labels in two or more phylogenetic trees or networks. The treewidth of such graphs is bounded as a…

Data Structures and Algorithms · Computer Science 2018-09-05 Remie Janssen , Mark Jones , Steven Kelk , Georgios Stamoulis , Taoyang Wu

The problem of reconstructing evolutionary trees or phylogenies is of great interest in computational biology. A popular model for this problem assumes that we are given the set of leaves (current species) of an unknown binary tree and the…

Data Structures and Algorithms · Computer Science 2022-06-16 Eshwar Ram Arunachaleswaran , Anindya De , Sampath Kannan

Scale-free networks are prevalently observed in a great variety of complex systems, which triggers various researches relevant to networked models of such type. In this work, we propose a family of growth tree networks $\mathcal{T}_{t}$,…

Combinatorics · Mathematics 2023-11-08 Fei Ma , Ping Wang

Phylogenetic networks are a generalization of phylogenetic trees that allow for representation of reticulate evolution. Recently, a space of unrooted phylogenetic networks was introduced, where such a network is a connected graph in which…

Populations and Evolution · Quantitative Biology 2017-03-09 Andrew Francis , Katharina Huber , Vincent Moulton , Taoyang Wu

Maximum parsimony distance is a measure used to quantify the dissimilarity of two unrooted phylogenetic trees. It is NP-hard to compute, and very few positive algorithmic results are known due to its complex combinatorial structure. Here we…

Data Structures and Algorithms · Computer Science 2020-04-07 Mark Jones , Steven Kelk , Leen Stougie

Graph alignment - identifying node correspondences between two graphs - is a fundamental problem with applications in network analysis, biology, and privacy research. While substantial progress has been made in aligning correlated…

Information Theory · Computer Science 2026-03-16 Jakob Maier , Laurent Massoulié

Phylogenetic networks extend phylogenetic trees to model non-vertical inheritance, by which a lineage inherits material from multiple parents. The computational complexity of estimating phylogenetic networks from genome-wide data with…

Populations and Evolution · Quantitative Biology 2022-06-28 Jingcheng Xu , Cécile Ané

Phylogenetic networks are a type of directed acyclic graph that represent how a set $X$ of present-day species are descended from a common ancestor by processes of speciation and reticulate evolution. In the absence of reticulate evolution,…

Combinatorics · Mathematics 2017-08-11 Andrew Francis , Charles Semple , Mike Steel

The last decade brought a significant increase in the amount of data and a variety of new inference methods for reconstructing the detailed evolutionary history of various cancers. This brings the need of designing efficient procedures for…

Data Structures and Algorithms · Computer Science 2020-04-30 Giulia Bernardini , Paola Bonizzoni , Paweł Gawrychowski

In this paper, we lay the groundwork on the comparison of phylogenetic networks based on edge contractions and expansions as edit operations, as originally proposed by Robinson and Foulds to compare trees. We prove that these operations…

Data Structures and Algorithms · Computer Science 2025-02-21 Bertrand Marchand , Nadia Tahiri , Olivier Tremblay-Savard , Manuel Lafond

We study search trees with 2-way comparisons (2WCST's), which involve separate less-than and equal-to tests in their nodes, each test having two possible outcomes, yes and no. These trees have a much subtler structure than standard search…

Data Structures and Algorithms · Computer Science 2023-12-08 Sunny Atalig , Marek Chrobak

We show how scale-free degree distributions can emerge naturally from growing networks by using random walks for selecting vertices for attachment. This result holds for several variants of the walk algorithm and for a wide range of…

Statistical Mechanics · Physics 2007-05-23 T. S. Evans , J. P. Saramaki

Phylogenetic tree comparison metrics are an important tool in the study of evolution, and hence the definition of such metrics is an interesting problem in phylogenetics. In a paper in Taxon fifty years ago, Sokal and Rohlf proposed to…

Populations and Evolution · Quantitative Biology 2013-01-22 Gabriel Cardona , Arnau Mir , Francesc Rossello , Lucia Rotger , David Sanchez

The quartet distance is a measure of similarity used to compare two unrooted phylogenetic trees on the same set of $n$ leaves, defined as the number of subsets of four leaves related by a different topology in both trees. After a series of…

Data Structures and Algorithms · Computer Science 2020-12-03 Bartłomiej Dudek , Paweł Gawrychowski

We present a new whole-genome based approach to infer large-scale phylogenies that is alignment- and reference-free. In contrast to other methods, it does not rely on pairwise comparisons to determine distances to infer edges in a tree.…

Populations and Evolution · Quantitative Biology 2019-05-16 Roland Wittler

A fundamental problem in network science is the normalization of the topological or physical distance between vertices, that requires understanding the range of variation of the unnormalized distances. Here we investigate the limits of the…

Discrete Mathematics · Computer Science 2021-02-18 Ramon Ferrer-i-Cancho , Carlos Gómez-Rodríguez , Juan Luis Esteban

In biology, a phylogenetic tree is a tool to represent the evolutionary relationship between species. Unfortunately, the classical Schr\"oder tree model is not adapted to take into account the chronology between the branching nodes. In…

Data Structures and Algorithms · Computer Science 2019-01-15 Olivier Bodini , Antoine Genitrini , Mehdi Naima

A classical result, fundamental to evolutionary biology, states that an edge-weighted tree $T$ with leaf set $X$, positive edge weights, and no vertices of degree 2 can be uniquely reconstructed from the set of leaf-to-leaf distances…

Populations and Evolution · Quantitative Biology 2011-07-15 A. W. M. Dress , K. T. Huber , M. Steel

As researchers collect increasingly large molecular data sets to reconstruct the Tree of Life, the heterogeneity of signals in the genomes of diverse organisms poses challenges for traditional phylogenetic analysis. A class of phylogenetic…

Populations and Evolution · Quantitative Biology 2015-09-11 Liang Liu , Zhenxiang Xi , Shaoyuan Wu , Charles Davis , Scott V. Edwards
‹ Prev 1 3 4 5 6 7 10 Next ›