Add to ORKG[[sponsorship]]統計科學研究所[[note]]已出版;[SCI];有審查制度;具代表性[[note]]http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=Drexel&SrcApp=hagerty_opac&KeyRecord=0001-8678&DestApp=JCR&RQ=IF_CAT_BOXPLO
When doing a bootstrap analysis with a single tree saved per pseudoreplicate, biased search algorith...
11 The title page shows a random digital search tree with 1000 nodes. The tree was taken from [74]. ...
Left: PCA plot of tree features from phylogenetic trees simulated on different networks: random (Erd...
We derive asymptotic approximations to the correlation coefficients of two level sizes in random rec...
[[sponsorship]]統計科學研究所[[note]]已出版;[SCI];有審查制度;具代表性[[note]]http://gateway.isiknowledge.com/gateway/Ga...
[[sponsorship]]統計科學研究所[[note]]已出版;[SCI];有審查制度;具代表性[[note]]http://gateway.isiknowledge.com/gateway/Ga...
[[sponsorship]]統計科學研究所[[note]]已出版;[SCI];有審查制度;具代表性[[note]]http://gateway.isiknowledge.com/gateway/Ga...
[[sponsorship]]統計科學研究所[[note]]已出版;[SCI];有審查制度;具代表性[[note]]http://gateway.isiknowledge.com/gateway/Ga...
Abstract. For random trees T generated by the binary search tree algorithm from uniformly distribute...
A binary search tree is a binary tree in which each (internal) node is as-sociated to a key, where t...
Abstract. In this survey we present results and the used proof techniques concerning the analysis of...
A new technique for searching lexically ordered binary trees is analyzed. Searching starts at a rand...
When doing a bootstrap analysis with a single tree saved per pseudoreplicate, biased search algorith...
This paper deals with statistics concerning distances between randomly chosen nodes in varieties of ...
[[sponsorship]]統計科學研究所[[note]]出版中(submitted);[SCI];有審查制度;具代表性[[note]]http://gateway.isiknowledge.com...
When doing a bootstrap analysis with a single tree saved per pseudoreplicate, biased search algorith...
11 The title page shows a random digital search tree with 1000 nodes. The tree was taken from [74]. ...
Left: PCA plot of tree features from phylogenetic trees simulated on different networks: random (Erd...
We derive asymptotic approximations to the correlation coefficients of two level sizes in random rec...
[[sponsorship]]統計科學研究所[[note]]已出版;[SCI];有審查制度;具代表性[[note]]http://gateway.isiknowledge.com/gateway/Ga...
[[sponsorship]]統計科學研究所[[note]]已出版;[SCI];有審查制度;具代表性[[note]]http://gateway.isiknowledge.com/gateway/Ga...
[[sponsorship]]統計科學研究所[[note]]已出版;[SCI];有審查制度;具代表性[[note]]http://gateway.isiknowledge.com/gateway/Ga...
[[sponsorship]]統計科學研究所[[note]]已出版;[SCI];有審查制度;具代表性[[note]]http://gateway.isiknowledge.com/gateway/Ga...
Abstract. For random trees T generated by the binary search tree algorithm from uniformly distribute...
A binary search tree is a binary tree in which each (internal) node is as-sociated to a key, where t...
Abstract. In this survey we present results and the used proof techniques concerning the analysis of...
A new technique for searching lexically ordered binary trees is analyzed. Searching starts at a rand...
When doing a bootstrap analysis with a single tree saved per pseudoreplicate, biased search algorith...
This paper deals with statistics concerning distances between randomly chosen nodes in varieties of ...
[[sponsorship]]統計科學研究所[[note]]出版中(submitted);[SCI];有審查制度;具代表性[[note]]http://gateway.isiknowledge.com...
When doing a bootstrap analysis with a single tree saved per pseudoreplicate, biased search algorith...
11 The title page shows a random digital search tree with 1000 nodes. The tree was taken from [74]. ...
Left: PCA plot of tree features from phylogenetic trees simulated on different networks: random (Erd...