Graph hierarchies for phylogeography

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Graph hierarchies for phylogeography.

Bayesian phylogeographic methods simultaneously integrate geographical and evolutionary modelling, and have demonstrated value in assessing spatial spread patterns of measurably evolving organisms. We improve on existing phylogeographic methods by combining information from multiple phylogeographic datasets in a hierarchical setting. Consider N exchangeable datasets or strata consisting of vira...

متن کامل

Graph minor hierarchies

In their work on graph minors, Robertson and Seymour begin by describing graphs whose structure is particularly simple, graphs that look roughly like thickened paths [ 8, 3 ]. They say that such graphs have small ‘path-width’. Of course, not every graph looks roughly like a thickened path, but it is possible to describe those that do not: every graph of large path-width contains a particular su...

متن کامل

Segmentation Graph Hierarchies

The region’s internal properties (color, texture, ...) help to identify them and their external relations (adjacency, inclusion, ...) are used to build groups of regions having a particular consistent meaning in a more abstract context. Low-level cue image segmentation in a bottom-up way, cannot and should not produce a complete final “good” segmentation. We present a hierarchical partitioning ...

متن کامل

Models of random graph hierarchies

We introduce two models of inclusion hierarchies: Random Graph Hierarchy (RGH) and Limited Random Graph Hierarchy (LRGH). In both models a set of nodes at a given hierarchy level is connected randomly, as in the Erdős-Rényi random graph, with a fixed average degree equal to a system parameter c. Clusters of the resulting network are treated as nodes at the next hierarchy level and they are conn...

متن کامل

Graph Partitioning and Semi-definite Programming Hierarchies

Graph partitioning is a fundamental optimization problem that has been intensively studied. Many graph partitioning formulations are important as building blocks for divide-and-conquer algorithms on graphs as well as to many applications such as VLSI layout, packet routing in distributed networks, clustering and image segmentation. Unfortunately such problems are notorious for the huge gap betw...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Philosophical Transactions of the Royal Society B: Biological Sciences

سال: 2013

ISSN: 0962-8436,1471-2970

DOI: 10.1098/rstb.2012.0206