Search Results

Documents authored by Yu, Tsan-Cheng


Document
Semi-Simplex Phylogenetic Networks: Tree-Child Networks and Galled Trees

Authors: Michael Fuchs and Tsan-Cheng Yu

Published in: LIPIcs, Volume 381, 37th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2026)


Abstract
Understanding the size of phylogenetic network classes and the typical shape of a random network from a fixed class has been one of the major research focuses in phylogenetics over the last couple of years. In this extended abstract, we consider two subclasses of the (recently introduced) class of semi-simplex phylogenetic networks, namely, semi-simplex tree-child networks and semi-simplex galled trees. We clarify their sizes relative to the (known) sizes of general tree-child networks and galled trees, respectively, and prove limit laws for parameters of random networks from these classes. Additional classes of semi-simplex networks will be considered in the journal version of this paper.

Cite as

Michael Fuchs and Tsan-Cheng Yu. Semi-Simplex Phylogenetic Networks: Tree-Child Networks and Galled Trees. In 37th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 381, pp. 5:1-5:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)


Copy BibTex To Clipboard

@InProceedings{fuchs_et_al:LIPIcs.AofA.2026.5,
  author =	{Fuchs, Michael and Yu, Tsan-Cheng},
  title =	{{Semi-Simplex Phylogenetic Networks: Tree-Child Networks and Galled Trees}},
  booktitle =	{37th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2026)},
  pages =	{5:1--5:17},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-435-2},
  ISSN =	{1868-8969},
  year =	{2026},
  volume =	{381},
  editor =	{Panagiotou, Konstantinos},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.AofA.2026.5},
  URN =		{urn:nbn:de:0030-drops-262768},
  doi =		{10.4230/LIPIcs.AofA.2026.5},
  annote =	{Keywords: Semi-simplex networks, tree-child networks, galled trees, enumeration, limit laws, Sackin index}
}
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail