( 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

 

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

Phylogenies without Branch Bounds: Contracting the Short, Pruning the Deep., , и . RECOMB, том 5541 из Lecture Notes in Computer Science, стр. 451-465. Springer, (2009)An Analytical Comparison of Multilocus Methods Under the Multispecies Coalescent: The Three-Taxon Case.. Pacific Symposium on Biocomputing, стр. 297-306. World Scientific Publishing, (2013)Slow emergence of cooperation for win-stay lose-shift on trees., и . Mach. Learn., 67 (1-2): 7-22 (2007)Incomplete Lineage Sorting: Consistent Phylogeny Estimation From Multiple Loci., и . CoRR, (2007)The Kesten-Stigum Reconstruction Bound Is Tight for Roughly Symmetric Binary Channels., , , и . FOCS, стр. 518-530. IEEE Computer Society, (2006)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)Robust Estimation of Latent Tree Graphical Models: Inferring Hidden States With Inexact Parameters., , и . IEEE Trans. Inf. Theory, 59 (7): 4357-4373 (2013)Network Delay Inference from Additive Metrics., , и . CoRR, (2006)Phylogenies without Branch Bounds: Contracting the Short, Pruning the Deep., , и . SIAM J. Discret. Math., 25 (2): 872-893 (2011)An approximation algorithm for Stackelberg network pricing., , и . Networks, 46 (1): 57-67 (2005)