The size of a maximum agreement subtree for random binary trees.
D. Bryant, A. McKenzie, и M. Steel. Bioconsensus, том 61 из DIMACS Series in Discrete Mathematics and Theoretical Computer Science, стр. 55-65. DIMACS/AMS, (2001)
Пожалуйста, войдите в систему, чтобы принять участие в дискуссии (добавить собственные рецензию, или комментарий)
Цитировать эту публикацию
%0 Conference Paper
%1 conf/dimacs/BryantMS01
%A Bryant, David
%A McKenzie, Andy
%A Steel, Mike A.
%B Bioconsensus
%D 2001
%E Janowitz, Melvin F.
%E Lapointe, François-Joseph
%E McMorris, Fred R.
%E Mirkin, Boris G.
%E Roberts, Fred S.
%I DIMACS/AMS
%K dblp
%P 55-65
%T The size of a maximum agreement subtree for random binary trees.
%U http://dblp.uni-trier.de/db/conf/dimacs/dimacs61.html#BryantMS01
%V 61
%@ 978-0-8218-3197-7
@inproceedings{conf/dimacs/BryantMS01,
added-at = {2022-06-09T00:00:00.000+0200},
author = {Bryant, David and McKenzie, Andy and Steel, Mike A.},
biburl = {https://www.bibsonomy.org/bibtex/2422dba63645da7e200c08aa69333fd5e/dblp},
booktitle = {Bioconsensus},
crossref = {conf/dimacs/dimacs61},
editor = {Janowitz, Melvin F. and Lapointe, François-Joseph and McMorris, Fred R. and Mirkin, Boris G. and Roberts, Fred S.},
ee = {https://doi.org/10.1090/dimacs/061/04},
interhash = {9f81130614bdd7aab23a2c315cec3607},
intrahash = {422dba63645da7e200c08aa69333fd5e},
isbn = {978-0-8218-3197-7},
keywords = {dblp},
pages = {55-65},
publisher = {DIMACS/AMS},
series = {DIMACS Series in Discrete Mathematics and Theoretical Computer Science},
timestamp = {2024-04-09T17:59:23.000+0200},
title = {The size of a maximum agreement subtree for random binary trees.},
url = {http://dblp.uni-trier.de/db/conf/dimacs/dimacs61.html#BryantMS01},
volume = 61,
year = 2001
}