( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Optimal phylogenetic reconstruction.

, , и . STOC, стр. 159-168. ACM, (2006)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Sébastien Beyou

Sébastien Tixeuil

Sébastien Lallé

Sébastien Carcanague

Sébastien Choplin

 

Другие публикации лиц с тем же именем

Slow emergence of cooperation for win-stay lose-shift on trees., и . Mach. Learn., 67 (1-2): 7-22 (2007)An Analytical Comparison of Multilocus Methods Under the Multispecies Coalescent: The Three-Taxon Case.. Pacific Symposium on Biocomputing, стр. 297-306. World Scientific Publishing, (2013)Phylogenies without Branch Bounds: Contracting the Short, Pruning the Deep., , и . RECOMB, том 5541 из Lecture Notes in Computer Science, стр. 451-465. Springer, (2009)Incomplete Lineage Sorting: Consistent Phylogeny Estimation From Multiple Loci., и . CoRR, (2007)Distance-based Species Tree Estimation: Information-Theoretic Trade-off between Number of Loci and Sequence Length under the Coalescent., и . APPROX-RANDOM, том 40 из LIPIcs, стр. 931-942. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)The Kesten-Stigum Reconstruction Bound Is Tight for Roughly Symmetric Binary Channels., , , и . FOCS, стр. 518-530. IEEE Computer Society, (2006)On learning thresholds of parities and unions of rectangles in random walk models.. Random Struct. Algorithms, 31 (4): 406-417 (2007)Alignment-Free Phylogenetic Reconstruction: Sample Complexity via a Branching Process Analysis, и . CoRR, (2011)A Short Proof that Phylogenetic Tree Reconstruction by Maximum Likelihood is Hard.. CoRR, (2005)An Approximation Algorithm for Stackelberg Network Pricing, , и . CoRR, (2004)