Tsan-Cheng Yu

dblp:353/1624 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2026
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 2 · 2 since 2021
YearPublicationVenuePosition
2026 Semi-Simplex Phylogenetic Networks: Tree-Child Networks and Galled Trees
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.
Michael Fuchs 0001, Tsan-Cheng Yu
AofA2
2023 Asymptotic normality for the size of graph tries built from M-ary tree labelings
Michael Fuchs 0001, Tsan-Cheng Yu
Theor. Comput. Sci.2