Publisher
Springer Science and Business Media LLC
Reference11 articles.
1. D. Aldous, Largest common substructures in probabilistic combinatorics. Preprint, available at https://www.stat.berkeley.edu/~aldous/Research/OP/common_subs.pdf.
2. D. Aldous, On the largest common subtree of random leaf-labeled binary trees SIAM J. Discrete Math. 36 (2022), no. 1, 299–314.
3. M. Bóna, P. Flajolet, Isomorphism and symmetries in random phylogenetic trees. J. Appl. Probab. 46 (2009), no. 4, 1005–1019.
4. M. Bóna, Combinatorics of Permutations, third edition. CRC Press, 2022.
5. D. Bryant, A. McKenzie, M. Steel, The size of a maximum agreement subtree for random binary trees, in BioConsensus, DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 61 AMS, Providence, RI 2003, 55–65.