Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

RSA
1998

favoriteEmaildiscussreport

53views more RSA 1998»

Recursive reconstruction on periodic trees

13 years 4 months ago

Recursive reconstruction on periodic trees

Download www.stat.berkeley.edu

A periodic tree Tn consists of full n-level copies of a ﬁnite tree T. The tree Tn is labeled by random bits. The root label is chosen randomly, and the probability of two adjacent vertices to have the same label is 1 − . This model simulates noisy propagation of a bit from the root, and has signiﬁcance both in communication theory and in biology. Our aim is to ﬁnd an algorithm which decides for every set

Elchanan Mossel

Real-time Traffic

Periodic Tree Tn | RSA 1998 | Tree Tn | ﬁnite Tree T |

claim paper

Related Content

» Asynchronous Parallel Construction of Recursive Tree Hierarchies

» RecIDCM3 A Fast Algorithmic Technique for Reconstructing Large Phylogenetic Trees

» A MultiNeighborJoining Approach for Phylogenetic Tree Reconstruction and Visualization

» Online Consensus and Agreement of Phylogenetic Trees

» QuartetBased Phylogeny Reconstruction from Gene Orders

» MHBH Efficient Mobility Management in Multicast

» The role of diverse populations in phylogenetic analysis

» Ancestral sequence alignment under optimal conditions

» Quantitative 3D CT bronchography

Post Info
More Details (n/a)

Added	23 Dec 2010
Updated	23 Dec 2010
Type	Journal
Year	1998
Where	RSA
Authors	Elchanan Mossel

Comments (0)