License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.APPROX-RANDOM.2015.931
URN: urn:nbn:de:0030-drops-53455
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2015/5345/
Go to the corresponding LIPIcs Volume Portal

Mossel, Elchanan ; Roch, Sebastien

Distance-based Species Tree Estimation: Information-Theoretic Trade-off between Number of Loci and Sequence Length under the Coalescent

pdf-format:
55.pdf (2 MB)

Abstract

We consider the reconstruction of a phylogeny from multiple genes under the multispecies coalescent. We establish a connection with the sparse signal detection problem, where one seeks to distinguish between a distribution and a mixture of the distribution and a sparse signal. Using this connection, we derive an information-theoretic trade-off between the number of genes needed for an accurate reconstruction and the sequence length of the genes.

BibTeX - Entry

@InProceedings{mossel_et_al:LIPIcs:2015:5345,
  author =	{Elchanan Mossel and Sebastien Roch},
  title =	{{Distance-based Species Tree Estimation: Information-Theoretic Trade-off between Number of Loci and Sequence Length under the Coalescent}},
  booktitle =	{Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015)},
  pages =	{931--942},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-89-7},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{40},
  editor =	{Naveen Garg and Klaus Jansen and Anup Rao and Jos{\'e} D. P. Rolim},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2015/5345},
  URN =		{urn:nbn:de:0030-drops-53455},
  doi =		{10.4230/LIPIcs.APPROX-RANDOM.2015.931},
  annote =	{Keywords: phylogenetic reconstruction, multispecies coalescent, sequence length requirement.}
}

Keywords: phylogenetic reconstruction, multispecies coalescent, sequence length requirement.
Collection: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015)
Issue Date: 2015
Date of publication: 13.08.2015

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI