中文
相关论文

相关论文: Perfect Reconstruction of Oncogenetic Trees

200 篇论文

Phylogenetically decisive collections of taxon sets have the property that if trees are chosen for each of their elements, as long as these trees are compatible, the resulting supertree is unique. This means that as long as the trees…

种群与进化 · 定量生物学 2025-05-29 Mareike Fischer , Janne Pott

We establish necessary and sufficient conditions on simultaneous symplectic spectral decomposition of a family of $2n \times 2n$ real positive semidefinite matrices with symplectic kernels. We also provide a precise algebraic condition on a…

数学物理 · 物理学 2026-02-27 Rudra R. Kamat , Hemant K. Mishra

Generating accurate digital tree models from scanned environments is invaluable for forestry, agriculture, and other outdoor industries in tasks such as identifying biomass, fall hazards and traversability, as well as digital applications…

计算机视觉与模式识别 · 计算机科学 2023-03-03 Thomas Lowe , Joshua Pinskier

Combinatorial trees can be used to represent genealogies of asexual individuals. These individuals can be endowed with birth and death times, to obtain a so-called `chronological tree'. In this work, we are interested in the continuum…

概率论 · 数学 2020-08-26 Amaury Lambert , Gerónimo Uribe Bravo

We construct quark mixing matrices within a group theoretic framework which is easily applicable to any number of generations. Familiar cases are retrieved and related, and it is hoped that our viewpoint may have advantages both…

高能物理 - 唯象学 · 物理学 2019-08-17 K. J. Barnes , O. J. Senior , N. D. Virgo

Necessary and sufficient conditions for a sequence of positive integers to be the degree sequence of a k-connected simple graph are detailed. Conditions are also given under which such a sequence is necessarily k-connected.

组合数学 · 数学 2015-12-19 Jonathan McLaughlin

We study the problem of constructing phylogenetic trees for a given set of species. The problem is formulated as that of finding a minimum Steiner tree on $n$ points over the Boolean hypercube of dimension $d$. It is known that an optimal…

数据结构与算法 · 计算机科学 2012-06-18 Pranjal Awasthi , Avrim Blum , Jamie Morgenstern , Or Sheffet

Existing techniques to reconstruct tree models of progression for accumulative processes, such as cancer, seek to estimate causation by combining correlation and a frequentist notion of temporal priority. In this paper, we define a novel…

Reconciling gene trees with a species tree is a fundamental problem to understand the evolution of gene families. Many existing approaches reconcile each gene tree independently. However, it is well-known that the evolution of gene families…

种群与进化 · 定量生物学 2018-06-12 Riccardo Dondi , Manuel Lafond , Celine Scornavacca

We provide the necessary and sufficient conditions for the edge-binomials of the tree forming a $d$-sequence in terms of the degree sequence notion of a graph. We study the regularity of powers of the binomial edge ideals of trees generated…

交换代数 · 数学 2023-05-19 Marie Amalore Nambi , Neeraj Kumar

For a given directed tree and weights associated with vertices from a subtree the completion problem is to determine if these weights may be completed in a way to obtain a bounded weighted shift on the whole tree, which possibly satisfies…

泛函分析 · 数学 2024-07-30 Michał Buchała

The paper contains a simple approach to reconstruction in Thermoacoustic and Photoacoustic Tomography. The technique works for any geometry of point detectors placement and for variable sound speed satisfying a non-trapping condition. A…

数值分析 · 数学 2009-11-13 Mark Agranovsky , Peter Kuchment

We provide sufficient criteria for explosion in Crump-Mode-Jagers branching process, via the process producing an infinite path in finite time. As an application, we deduce a curious phase-transition in the infinite tree associated with a…

概率论 · 数学 2024-11-20 Tejas Iyer

We present a framework for the design of optimal assembly algorithms for shotgun sequencing under the criterion of complete reconstruction. We derive a lower bound on the read length and the coverage depth required for reconstruction in…

基因组学 · 定量生物学 2013-02-20 Guy Bresler , Ma'ayan Bresler , David Tse

A classical problem in phylogenetic tree analysis is to decide whether there is a phylogenetic tree $T$ that contains all information of a given collection $\cP$ of phylogenetic trees. If the answer is "yes" we say that $\cP$ is compatible…

组合数学 · 数学 2010-06-29 Stefan Grünewald

We propose an approach to 3D reconstruction via inverse procedural modeling and investigate two variants of this approach. The first option consists in the fitting set of input parameters using a genetic algorithm. We demonstrate the…

图形学 · 计算机科学 2023-10-23 Albert Garifullin , Nikolay Maiorov , Vladimir Frolov

Certain families of combinatorial objects admit recursive descriptions in terms of generating trees: each node of the tree corresponds to an object, and the branch leading to the node encodes the choices made in the construction of the…

We consider matrices on infinite trees which are universal covers of Jacobi matrices on finite graphs. We are interested in the question of the existence of sequences of finite covers whose normalized eigenvalue counting measures converge…

谱理论 · 数学 2020-11-12 Nir Avni , Jonathan Breuer , Gil Kalai , Barry Simon

A general model for the ontogenetic growth of living organisms has been recently proposed. Here we investigate the extension of this model to the growth of solid malignant tumors. A variety of in vitro and in vivo data are analyzed and…

More than 30 years ago, we published a paper entitled as abnormal chromatin configuration and oncogenesis, which proposed the first hypothesis that links oncogenesis to abnormal three-dimensional (3D) genome structure. Recently, many…

亚细胞过程 · 定量生物学 2019-02-07 Gao-De Li
‹ 上一页 1 8 9 10 下一页 ›