| Publication | Date of Publication | Type |
|---|
Maximum likelihood estimation for unrooted 3-leaf trees: an analytic solution for the CFN model
Bulletin of Mathematical Biology | 2024-09-10 | Paper |
Pairwise sequence alignment at arbitrarily large evolutionary distance
The Annals of Applied Probability | 2024-08-22 | Paper |
Expanding the class of global objective functions for dissimilarity-based hierarchical clustering
Journal of Classification | 2024-02-01 | Paper |
Statistically consistent rooting of species trees under the multispecies coalescent model
Lecture Notes in Computer Science | 2023-11-24 | Paper |
Modern Discrete Probability
| 2023-11-08 | Paper |
Circular Networks from Distorted Metrics
Lecture Notes in Computer Science | 2023-03-09 | Paper |
Species tree estimation under joint modeling of coalescence and duplication: sample complexity of quartet methods
The Annals of Applied Probability | 2022-12-20 | Paper |
An impossibility result for phylogeny reconstruction from \(k\)-mer counts
The Annals of Applied Probability | 2022-12-20 | Paper |
Polynomial-Time Statistical Estimation of Species Trees Under Gene Duplication and Loss
Lecture Notes in Computer Science | 2022-10-14 | Paper |
On the effect of intralocus recombination on triplet-based species tree estimation
| 2022-08-30 | Paper |
Pairwise sequence alignment at arbitrarily large evolutionary distance
| 2022-07-25 | Paper |
A stochastic Farris transform for genetic data under the multispecies coalescent with applications to data requirements
Journal of Mathematical Biology | 2022-05-05 | Paper |
Sufficient condition for root reconstruction by parsimony on binary trees with general weights
Electronic Communications in Probability | 2022-01-06 | Paper |
Impossibility of phylogeny reconstruction from $k$-mer counts
| 2020-10-27 | Paper |
Impossibility of consistent distance estimation from sequence lengths under the TKF91 model
Bulletin of Mathematical Biology | 2020-09-17 | Paper |
Asymptotic seed bias in respondent-driven sampling
Electronic Journal of Statistics | 2020-05-13 | Paper |
Statistically consistent and computationally efficient inference of ancestral DNA sequences in the TKF91 model under dense taxon sampling
Bulletin of Mathematical Biology | 2020-02-21 | Paper |
Book Review: Phylogeny—discrete and random processes in evolution
Bulletin of the American Mathematical Society | 2019-10-30 | Paper |
Generalized least squares can overcome the critical threshold in respondent-driven sampling
Proceedings of the National Academy of Sciences | 2019-07-03 | Paper |
On the variance of internode distance under the multispecies coalescent
| 2018-12-19 | Paper |
Reducing Seed Bias in Respondent-Driven Sampling by Estimating Block Transition Probabilities
| 2018-12-03 | Paper |
Necessary and sufficient conditions for consistent root reconstruction in Markov models on trees
Electronic Journal of Probability | 2018-08-24 | Paper |
Species trees from gene trees despite a high rate of lateral genetic transfer: a tight bound (extended abstract)
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Long-branch attraction in species tree estimation: inconsistency of partitioned likelihood and topology-based summary methods
| 2018-03-07 | Paper |
Phase transition in the sample complexity of likelihood-based phylogeny inference
Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete | 2018-02-05 | Paper |
Distance-based species tree estimation under the coalescent: information-theoretic trade-off between number of loci and sequence length
The Annals of Applied Probability | 2018-01-04 | Paper |
Geometry of the sample frequency spectrum and the perils of demographic inference
| 2017-12-13 | Paper |
Distance-based species tree estimation: information-theoretic trade-off between number of loci and sequence length under the coalescent
| 2017-08-31 | Paper |
Coalescent-based species tree estimation: a stochastic Farris transform
| 2017-07-13 | Paper |
Robust Estimation of Latent Tree Graphical Models: Inferring Hidden States With Inexact Parameters
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Species tree estimation using ASTRAL: how many genes are enough?
| 2017-04-22 | Paper |
Phase transition on the convergence rate of parameter estimation under an Ornstein-Uhlenbeck diffusion on a tree
Journal of Mathematical Biology | 2017-01-25 | Paper |
Likelihood-based tree reconstruction on a concatenation of aligned sequence data sets can be statistically inconsistent
Theoretical Population Biology | 2016-03-02 | Paper |
Species Trees are Recoverable from Unrooted Gene Tree Topologies Under a Constant Rate of Horizontal Gene Transfer
| 2015-08-08 | Paper |
Optimal phylogenetic reconstruction
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 2014-11-25 | Paper |
Data Requirement for Phylogenetic Inference from Multiple Loci: A New Distance Method
| 2014-04-28 | Paper |
Identifiability and inference of non-parametric rates-across-sites models on large-scale phylo\-genies
Journal of Mathematical Biology | 2013-11-04 | Paper |
Alignment-free phylogenetic reconstruction: Sample complexity via a branching process analysis
The Annals of Applied Probability | 2013-04-24 | Paper |
Phylogenetic mixtures: concentration of measure in the large-tree limit
The Annals of Applied Probability | 2013-01-25 | Paper |
Global alignment of molecular sequences via ancestral state reconstruction
Stochastic Processes and their Applications | 2012-10-26 | Paper |
An analytical comparison of coalescent-based multilocus methods: The three-taxon case
| 2012-07-17 | Paper |
Recovering the tree-like trend of evolution despite extensive lateral genetic transfer: A probabilistic analysis
| 2012-06-15 | Paper |
Toward extracting all phylogenetic information from matrices of evolutionary distances
Science | 2011-11-30 | Paper |
On the inference of large phylogenies with long branches: how long is too long?
Bulletin of Mathematical Biology | 2011-11-04 | Paper |
Phylogenies without branch bounds: contracting the short, pruning the deep
SIAM Journal on Discrete Mathematics | 2011-10-27 | Paper |
Evolutionary trees and the Ising model on the Bethe lattice: A proof of Steel's conjecture
Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete | 2011-09-27 | Paper |
Reconstruction on trees: exponential moment bounds for linear estimators
Electronic Communications in Probability | 2011-09-09 | Paper |
Phase Transition in Distance-Based Phylogeny Reconstruction
| 2011-08-29 | Paper |
Submodularity of influence in social networks: from local to global
SIAM Journal on Computing | 2011-01-17 | Paper |
Network delay inference from additive metrics
Random Structures \& Algorithms | 2010-11-10 | Paper |
Learning nonsingular phylogenies and hidden Markov models
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
Transient growth in Taylor–Couette flow
Physics of Fluids | 2010-04-22 | Paper |
Sequence-Length Requirement of Distance-Based Phylogeny Reconstruction: Breaking the Polynomial Barrier
| 2009-08-14 | Paper |
scientific article; zbMATH DE number 5485445 (Why is no real title available?)
| 2009-01-05 | Paper |
Shrinkage Effect in Ancestral Maximum Likelihood
| 2008-02-07 | Paper |
On learning thresholds of parities and unions of rectangles in random walk models
Random Structures \& Algorithms | 2008-01-08 | Paper |
First to Market is not Everything: an Analysis of Preferential Attachment with Fitness
| 2007-10-25 | Paper |
Incomplete Lineage Sorting: Consistent Phylogeny Estimation From Multiple Loci
| 2007-10-01 | Paper |
Slow emergence of cooperation for win-stay lose-shift on trees
Machine Learning | 2007-09-20 | Paper |
Learning nonsingular phylogenies and hidden Markov models
The Annals of Applied Probability | 2007-08-08 | Paper |
Bounding fastest mixing
Electronic Communications in Probability | 2006-11-03 | Paper |
A smoothing heuristic for a bilevel pricing problem
European Journal of Operational Research | 2006-09-14 | Paper |
The Kesten-Stigum Reconstruction Bound Is Tight for Roughly Symmetric Binary Channels
| 2006-04-17 | Paper |
An approximation algorithm for Stackelberg network pricing
Networks | 2005-09-22 | Paper |
An Approximation Algorithm for Stackelberg Network Pricing
| 2004-09-26 | Paper |
Transient growth in exactly counter-rotating Couette-Taylor flow
Theoretical and Computational Fluid Dynamics | 2003-08-26 | Paper |
Non-colliding random walks, tandem queues, and discrete orthogonal polynomial ensembles
Electronic Journal of Probability | 2003-02-13 | Paper |
