Root location in random trees: A polarity property of all sampling consistent phylogenetic models except one

نویسندگان

چکیده

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

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

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

منابع مشابه

Root location in random trees: a polarity property of all sampling consistent phylogenetic models except one.

Neutral macroevolutionary models, such as the Yule model, give rise to a probability distribution on the set of discrete rooted binary trees over a given leaf set. Such models can provide a signal as to the approximate location of the root when only the unrooted phylogenetic tree is known, and this signal becomes relatively more significant as the number of leaves grows. In this short note, we ...

متن کامل

Covering all points except one

In many point-line geometries, to cover all points except one, more lines are needed than to cover all points. Bounds can be given by looking at the dimension of the space of functions induced by polynomials of bounded degree.

متن کامل

Sampling motifs on phylogenetic trees.

We present a method to find motifs by simultaneously using the overrepresentation property and the evolutionary conservation property of motifs. This method is applicable to divergent species where alignment is unreliable, which overcomes a major limitation of the current methods. The method has been applied to search regulatory motifs in four yeast species based on ChIP-chip data in Saccharomy...

متن کامل

Counting consistent phylogenetic trees is #P-complete

Reconstructing phylogenetic trees is a fundamental task in evolutionary biology. Various algorithms exist for this purpose, many of which come under the heading of ‘supertree methods.’ These methods amalgamate a collection P of phylogenetic trees into a single parent tree. In this paper, we show that, in both the rooted and unrooted settings, counting the number of parent trees that preserve al...

متن کامل

Random Sampling from B+ Trees

We consider the design and analysis of algorithms to retrieve simple random samples from databases. Specifically, we examine simple random sampling from B+ tree files. Existing methods of sampling from B+ trees, require the use of auxiliary rank information in the nodes of the tree. Such modified B+ tree files are called “ranked B+ trees”. We compare sampling from ranked Bt tree files, with new...

متن کامل

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


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

ژورنال

عنوان ژورنال: Molecular Phylogenetics and Evolution

سال: 2012

ISSN: 1055-7903

DOI: 10.1016/j.ympev.2012.06.022