{"id":185903,"date":"2011-02-08T00:00:00","date_gmt":"2011-02-08T14:04:51","guid":{"rendered":"https:\/\/www.microsoft.com\/en-us\/research\/msr-research-item\/the-reconstruction-problem-on-the-tree\/"},"modified":"2016-08-22T11:30:46","modified_gmt":"2016-08-22T18:30:46","slug":"the-reconstruction-problem-on-the-tree","status":"publish","type":"msr-video","link":"https:\/\/www.microsoft.com\/en-us\/research\/video\/the-reconstruction-problem-on-the-tree\/","title":{"rendered":"The Reconstruction Problem on the Tree"},"content":{"rendered":"<div class=\"asset-content\">\n<p>The reconstruction problem on the tree concerns the propagation of information in Markov processes on trees and has been studied in probability, statistical physics, computational biology, information theory and theoretical computer science.  I will discuss progress in establishing thresholds for the reconstruction problem and give an overview of its applications to phylogenetic reconstruction, mixing times of Markov chains, random constraint satisfaction problems and the computational complexity of counting problems.<\/p>\n<\/div>\n<p><!-- .asset-content --><\/p>\n","protected":false},"excerpt":{"rendered":"<p>The reconstruction problem on the tree concerns the propagation of information in Markov processes on trees and has been studied in probability, statistical physics, computational biology, information theory and theoretical computer science. I will discuss progress in establishing thresholds for the reconstruction problem and give an overview of its applications to phylogenetic reconstruction, mixing times [&hellip;]<\/p>\n","protected":false},"featured_media":195977,"template":"","meta":{"msr-url-field":"","msr-podcast-episode":"","msrModifiedDate":"","msrModifiedDateEnabled":false,"ep_exclude_from_search":false,"footnotes":""},"research-area":[13561],"msr-video-type":[],"msr-locale":[268875],"msr-impact-theme":[],"msr-pillar":[],"class_list":["post-185903","msr-video","type-msr-video","status-publish","has-post-thumbnail","hentry","msr-research-area-algorithms","msr-locale-en_us"],"msr_download_urls":"","msr_external_url":"https:\/\/youtu.be\/dPoh3OPNLHA","msr_secondary_video_url":"","msr_video_file":"","_links":{"self":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-video\/185903"}],"collection":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-video"}],"about":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/types\/msr-video"}],"version-history":[{"count":0,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-video\/185903\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/media\/195977"}],"wp:attachment":[{"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/media?parent=185903"}],"wp:term":[{"taxonomy":"msr-research-area","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/research-area?post=185903"},{"taxonomy":"msr-video-type","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-video-type?post=185903"},{"taxonomy":"msr-locale","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-locale?post=185903"},{"taxonomy":"msr-impact-theme","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-impact-theme?post=185903"},{"taxonomy":"msr-pillar","embeddable":true,"href":"https:\/\/www.microsoft.com\/en-us\/research\/wp-json\/wp\/v2\/msr-pillar?post=185903"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}