default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSébastien Roch
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j18]Sebastien Roch
:
Expanding the Class of Global Objective Functions for Dissimilarity-Based Hierarchical Clustering. J. Classif. 40(3): 513-526 (2023)- [j17]Yasamin Tabatabaee, Sebastien Roch, Tandy J. Warnow:
QR-STAR: A Polynomial-Time Statistically Consistent Method for Rooting Species Trees Under the Coalescent. J. Comput. Biol. 30(11): 1146-1181 (2023) - [c21]Yasamin Tabatabaee, Sébastien Roch, Tandy J. Warnow:
Statistically Consistent Rooting of Species Trees Under the Multispecies Coalescent Model. RECOMB 2023: 41-57 - 2022
- [j16]Max Hill, Sebastien Roch:
Inconsistency of Triplet-Based and Quartet-Based Species Tree Estimation under Intralocus Recombination. J. Comput. Biol. 29(11): 1173-1197 (2022) - [c20]Max Hill, Sebastien Roch:
On the Effect of Intralocus Recombination on Triplet-Based Species Tree Estimation. RECOMB 2022: 143-158 - [i42]Brandon Legried, Sebastien Roch:
Pairwise sequence alignment at arbitrarily large evolutionary distance. CoRR abs/2207.12543 (2022) - [i41]Sebastien Roch:
Expanding the class of global objective functions for dissimilarity-based hierarchical clustering. CoRR abs/2207.14375 (2022) - 2021
- [j15]Brandon Legried, Erin K. Molloy, Tandy J. Warnow, Sébastien Roch:
Polynomial-Time Statistical Estimation of Species Trees Under Gene Duplication and Loss. J. Comput. Biol. 28(5): 452-468 (2021) - [i40]Fan Chen, Sebastien Roch, Karl Rohe, Shuqi Yu:
Estimating Graph Dimension with Cross-validated Eigenvalues. CoRR abs/2108.03336 (2021) - 2020
- [c19]Brandon Legried, Erin K. Molloy, Tandy J. Warnow, Sébastien Roch:
Polynomial-Time Statistical Estimation of Species Trees Under Gene Duplication and Loss. RECOMB 2020: 120-135 - [i39]Wai-Tong Louis Fan, Brandon Legried, Sebastien Roch:
Impossibility of phylogeny reconstruction from k-mer counts. CoRR abs/2010.14460 (2020)
2010 – 2019
- 2018
- [j14]Shubhanshu Shekhar, Sebastien Roch, Siavash Mirarab:
Species Tree Estimation Using ASTRAL: How Many Genes Are Enough? IEEE ACM Trans. Comput. Biol. Bioinform. 15(5): 1738-1747 (2018) - [c18]Sebastien Roch, Kun-Chieh Wang:
Circular Networks from Distorted Metrics. RECOMB 2018: 167-176 - [c17]Sébastien Roch:
On the Variance of Internode Distance Under the Multispecies Coalescent. RECOMB-CG 2018: 196-206 - [i38]Sebastien Roch, Michael Nute, Tandy J. Warnow:
Long-branch attraction in species tree estimation: inconsistency of partitioned likelihood and topology-based summary methods. CoRR abs/1803.02800 (2018) - [i37]Yuling Yan, Bret M. Hanlon, Sebastien Roch, Karl Rohe:
Asymptotic Seed Bias in Respondent-driven Sampling. CoRR abs/1808.10593 (2018) - [i36]Yilin Zhang, Karl Rohe, Sebastien Roch:
Reducing Seed Bias in Respondent-Driven Sampling by Estimating Block Transition Probabilities. CoRR abs/1812.01188 (2018) - [i35]Sebastien Roch:
On the variance of internode distance under the multispecies coalescent. CoRR abs/1812.08357 (2018) - 2017
- [c16]Shubhanshu Shekhar, Sebastien Roch, Siavash Mirarab:
Species Tree Estimation Using ASTRAL: How Many Genes Are Enough? RECOMB 2017: 393-395 - [i34]Shubhanshu Shekhar, Sebastien Roch, Siavash Mirarab:
Species tree estimation using ASTRAL: how many genes are enough? CoRR abs/1704.06831 (2017) - [i33]Gautam Dasarathy, Elchanan Mossel, Robert D. Nowak, Sebastien Roch:
Coalescent-based species tree estimation: a stochastic Farris transform. CoRR abs/1707.04300 (2017) - [i32]Wai-Tong Fan, Sebastien Roch:
Necessary and sufficient conditions for consistent root reconstruction in Markov models on trees. CoRR abs/1707.05702 (2017) - [i31]Wai-Tong Fan, Sebastien Roch:
Efficient and consistent inference of ancestral sequences in an evolutionary model with insertions and deletions under dense taxon sampling. CoRR abs/1707.05711 (2017) - [i30]Sebastien Roch, Kun-Chieh Wang:
Circular Networks from Distorted Metrics. CoRR abs/1707.05722 (2017) - [i29]Sebastien Roch, Kun-Chieh Wang:
Critical threshold for ancestral reconstruction by maximum parsimony on general phylogenies. CoRR abs/1708.02524 (2017) - [i28]Sebastien Roch, Karl Rohe:
Generalized least squares can overcome the critical threshold in respondent-driven sampling. CoRR abs/1708.04999 (2017) - 2016
- [c15]Constantinos Daskalakis, Sebastien Roch:
Species Trees from Gene Trees Despite a High Rate of Lateral Genetic Transfer: A Tight Bound (Extended Abstract). SODA 2016: 1621-1630 - 2015
- [j13]Gautam Dasarathy, Robert D. Nowak, Sébastien Roch:
Data Requirement for Phylogenetic Inference from Multiple Loci: A New Distance Method. IEEE ACM Trans. Comput. Biol. Bioinform. 12(2): 422-432 (2015) - [c14]Elchanan Mossel, Sébastien Roch:
Distance-based Species Tree Estimation: Information-Theoretic Trade-off between Number of Loci and Sequence Length under the Coalescent. APPROX-RANDOM 2015: 931-942 - [i27]Elchanan Mossel, Sébastien Roch:
Distance-based species tree estimation: information-theoretic trade-off between number of loci and sequence length under the coalescent. CoRR abs/1504.05289 (2015) - [i26]Constantinos Daskalakis, Sébastien Roch:
Species Trees from Gene Trees Despite a High Rate of Lateral Genetic Transfer: A Tight Bound. CoRR abs/1508.01962 (2015) - 2014
- [c13]Gautam Dasarathy, Robert D. Nowak, Sébastien Roch:
New sample complexity bounds for phylogenetic inference from multiple loci. ISIT 2014: 2037-2041 - [i25]Gautam Dasarathy, Robert D. Nowak, Sebastien Roch:
Data Requirement for Phylogenetic Inference from Multiple Loci: A New Distance Method. CoRR abs/1404.7055 (2014) - [i24]Cécile Ané, Lam Si Tung Ho, Sebastien Roch:
Phase transition on the convergence rate of parameter estimation under an Ornstein-Uhlenbeck diffusion on a tree. CoRR abs/1406.1568 (2014) - [i23]Sebastien Roch, Mike A. Steel:
Likelihood-based tree reconstruction on a concatenation of alignments can be positively misleading. CoRR abs/1409.2051 (2014) - 2013
- [j12]Sebastien Roch, Sagi Snir:
Recovering the Treelike Trend of Evolution Despite Extensive Lateral Genetic Transfer: A Probabilistic Analysis. J. Comput. Biol. 20(2): 93-112 (2013) - [j11]Elchanan Mossel, Sébastien Roch, Allan Sly:
Robust Estimation of Latent Tree Graphical Models: Inferring Hidden States With Inexact Parameters. IEEE Trans. Inf. Theory 59(7): 4357-4373 (2013) - [c12]Sébastien Roch:
An Analytical Comparison of Multilocus Methods Under the Multispecies Coalescent: The Three-Taxon Case. Pacific Symposium on Biocomputing 2013: 297-306 - 2012
- [c11]Sebastien Roch, Sagi Snir:
Recovering the Tree-Like Trend of Evolution Despite Extensive Lateral Genetic Transfer: A Probabilistic Analysis. RECOMB 2012: 224-238 - [c10]Vahab S. Mirrokni, Sebastien Roch, Mukund Sundararajan:
On Fixed-Price Marketing for Goods with Positive Network Externalities. WINE 2012: 532-538 - [i22]Sebastien Roch, Sagi Snir:
Recovering the tree-like trend of evolution despite extensive lateral genetic transfer: A probabilistic analysis. CoRR abs/1206.3520 (2012) - [i21]Sebastien Roch:
An analytical comparison of coalescent-based multilocus methods: The three-taxon case. CoRR abs/1207.4074 (2012) - 2011
- [j10]Constantinos Daskalakis, Elchanan Mossel, Sébastien Roch:
Phylogenies without Branch Bounds: Contracting the Short, Pruning the Deep. SIAM J. Discret. Math. 25(2): 872-893 (2011) - [i20]Elchanan Mossel, Sebastien Roch:
Identifiability and inference of non-parametric rates-across-sites models on large-scale phylogenies. CoRR abs/1108.0129 (2011) - [i19]Elchanan Mossel, Sebastien Roch:
Phylogenetic mixtures: Concentration of measure in the large-tree limit. CoRR abs/1108.3112 (2011) - [i18]Sebastien Roch:
Phase Transition in Distance-Based Phylogeny Reconstruction. CoRR abs/1108.5781 (2011) - [i17]Elchanan Mossel, Sébastien Roch, Allan Sly:
Robust estimation of latent tree graphical models: Inferring hidden states with inexact parameters. CoRR abs/1109.4668 (2011) - [i16]Constantinos Daskalakis, Sébastien Roch:
Alignment-Free Phylogenetic Reconstruction: Sample Complexity via a Branching Process Analysis. CoRR abs/1109.5002 (2011) - 2010
- [j9]Shankar Bhamidi, Ram Rajagopal, Sébastien Roch:
Network delay inference from additive metrics. Random Struct. Algorithms 37(2): 176-203 (2010) - [j8]Elchanan Mossel, Sébastien Roch:
Submodularity of Influence in Social Networks: From Local to Global. SIAM J. Comput. 39(6): 2176-2188 (2010) - [j7]Elchanan Mossel, Sébastien Roch:
Incomplete Lineage Sorting: Consistent Phylogeny Estimation from Multiple Loci. IEEE ACM Trans. Comput. Biol. Bioinform. 7(1): 166-171 (2010) - [c9]Alexandr Andoni, Constantinos Daskalakis, Avinatan Hassidim, Sébastien Roch:
Global Alignment of Molecular Sequences via Ancestral State Reconstruction. ICS 2010: 358-369 - [c8]Constantinos Daskalakis, Sébastien Roch:
Alignment-Free Phylogenetic Reconstruction. RECOMB 2010: 123-137 - [i15]Elchanan Mossel, Sebastien Roch, Allan Sly:
On the inference of large phylogenies with long branches: How long is too long? CoRR abs/1001.3480 (2010)
2000 – 2009
- 2009
- [j6]Elchanan Mossel, Sébastien Roch, Mike A. Steel:
Shrinkage Effect in Ancestral Maximum Likelihood. IEEE ACM Trans. Comput. Biol. Bioinform. 6(1): 126-133 (2009) - [c7]Constantinos Daskalakis, Elchanan Mossel, Sébastien Roch:
Phylogenies without Branch Bounds: Contracting the Short, Pruning the Deep. RECOMB 2009: 451-465 - [i14]Yuval Peres, Sebastien Roch:
Reconstruction on Trees: Exponential Moment Bounds for Linear Estimators. CoRR abs/0908.2056 (2009) - [i13]Sebastien Roch:
Sequence-Length Requirement of Distance-Based Phylogeny Reconstruction: Breaking the Polynomial Barrier. CoRR abs/0908.2061 (2009) - [i12]Alexandr Andoni, Constantinos Daskalakis, Avinatan Hassidim, Sébastien Roch:
Global Alignment of Molecular Sequences via Ancestral State Reconstruction. CoRR abs/0912.2577 (2009) - 2008
- [c6]Sébastien Roch:
Sequence Length Requirement of Distance-Based Phylogeny Reconstruction: Breaking the Polynomial Barrier. FOCS 2008: 729-738 - [i11]Constantinos Daskalakis, Elchanan Mossel, Sebastien Roch:
Phylogenies without Branch Bounds: Contracting the Short, Pruning the Deep. CoRR abs/0801.4190 (2008) - [i10]Elchanan Mossel, Sebastien Roch, Mike A. Steel:
Shrinkage Effect in Ancestral Maximum Likelihood. CoRR abs/0802.0914 (2008) - 2007
- [j5]Elchanan Mossel, Sébastien Roch:
Slow emergence of cooperation for win-stay lose-shift on trees. Mach. Learn. 67(1-2): 7-22 (2007) - [j4]Sébastien Roch:
On learning thresholds of parities and unions of rectangles in random walk models. Random Struct. Algorithms 31(4): 406-417 (2007) - [c5]Elchanan Mossel, Sébastien Roch:
On the submodularity of influence in social networks. STOC 2007: 128-134 - [c4]Christian Borgs, Jennifer T. Chayes, Constantinos Daskalakis, Sébastien Roch:
First to market is not everything: an analysis of preferential attachment with fitness. STOC 2007: 135-144 - [i9]Elchanan Mossel, Sébastien Roch:
Incomplete Lineage Sorting: Consistent Phylogeny Estimation From Multiple Loci. CoRR abs/0710.0262 (2007) - [i8]Christian Borgs, Jennifer T. Chayes, Constantinos Daskalakis, Sebastien Roch:
First to Market is not Everything: an Analysis of Preferential Attachment with Fitness. CoRR abs/0710.4982 (2007) - 2006
- [j3]Jean-Pierre Dussault, Patrice Marcotte, Sébastien Roch, Gilles Savard:
A smoothing heuristic for a bilevel pricing problem. Eur. J. Oper. Res. 174(3): 1396-1413 (2006) - [j2]Sébastien Roch:
A Short Proof that Phylogenetic Tree Reconstruction by Maximum Likelihood Is Hard. IEEE ACM Trans. Comput. Biol. Bioinform. 3(1): 92-94 (2006) - [c3]Christian Borgs, Jennifer T. Chayes, Elchanan Mossel, Sébastien Roch:
The Kesten-Stigum Reconstruction Bound Is Tight for Roughly Symmetric Binary Channels. FOCS 2006: 518-530 - [c2]Constantinos Daskalakis, Elchanan Mossel, Sébastien Roch:
Optimal phylogenetic reconstruction. STOC 2006: 159-168 - [i7]Christian Borgs, Jennifer T. Chayes, Elchanan Mossel, Sebastien Roch:
The Kesten-Stigum Reconstruction Bound Is Tight for Roughly Symmetric Binary Channels. CoRR abs/math/0604366 (2006) - [i6]Shankar Bhamidi, Ram Rajagopal, Sébastien Roch:
Network Delay Inference from Additive Metrics. CoRR abs/math/0604367 (2006) - [i5]Elchanan Mossel, Sebastien Roch:
On the Submodularity of Influence in Social Networks. CoRR abs/math/0612046 (2006) - 2005
- [j1]Sébastien Roch, Gilles Savard, Patrice Marcotte:
An approximation algorithm for Stackelberg network pricing. Networks 46(1): 57-67 (2005) - [c1]Elchanan Mossel, Sébastien Roch:
Learning nonsingular phylogenies and hidden Markov models. STOC 2005: 366-375 - [i4]Elchanan Mossel, Sébastien Roch:
Learning nonsingular phylogenies and hidden Markov models. CoRR abs/cs/0502076 (2005) - [i3]Sébastien Roch:
A Short Proof that Phylogenetic Tree Reconstruction by Maximum Likelihood is Hard. CoRR abs/math/0504378 (2005) - [i2]Constantinos Daskalakis, Elchanan Mossel, Sebastien Roch:
Evolutionary Trees and the Ising Model on the Bethe Lattice: a Proof of Steel's Conjecture. CoRR abs/math/0509575 (2005) - 2004
- [i1]Sébastien Roch, Patrice Marcotte, Gilles Savard:
An Approximation Algorithm for Stackelberg Network Pricing. CoRR cs.GT/0409054 (2004)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 22:55 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
