On the asymptotic growth of the number of tree-child networks
暂无分享,去创建一个
[1] Louxin Zhang,et al. Counting Tree-Child Networks and Their Subclasses , 2019, 1908.01917.
[2] Tsuyoshi Murata,et al. {m , 1934, ACML.
[3] Louxin Zhang,et al. Generating normal networks via leaf insertion and nearest neighbor interchange , 2019, BMC Bioinformatics.
[4] Andrew Elvey Price,et al. Compacted binary trees admit a stretched exponential , 2019, J. Comb. Theory, Ser. A.
[6] P. Alam. ‘L’ , 2021, Composites Engineering: An A–Z Guide.
[7] Ronald L. Graham,et al. Concrete mathematics - a foundation for computer science , 1991 .
[8] Louxin Zhang,et al. Counting and enumerating galled networks , 2018, Discret. Appl. Math..
[9] Philippe Flajolet,et al. Analytic Combinatorics , 2009 .
[10] Bernhard Gittenberger,et al. Counting phylogenetic networks with few reticulation vertices: tree-child and normal networks , 2018, Australas. J Comb..
[11] Danna Zhou,et al. d. , 1840, Microbial pathogenesis.
[12] Colin McDiarmid,et al. Counting Phylogenetic Networks , 2015 .