Bitte melden Sie sich an um selbst Rezensionen oder Kommentare zu erstellen.
Zitieren Sie diese Publikation
Mehr Zitationsstile
- bitte auswählen -
%0 Conference Paper
%1 conf/wabi/Addario-BerryCHLPW03
%A Addario-Berry, Louigi
%A Chor, Benny
%A Hallett, Michael T.
%A Lagergren, Jens
%A Panconesi, Alessandro
%A Wareham, Todd
%B WABI
%D 2003
%E Benson, Gary
%E Page, Roderic D. M.
%I Springer
%K dblp
%P 202-215
%T Ancestral Maximum Likelihood of Evolutionary Trees Is Hard.
%U http://dblp.uni-trier.de/db/conf/wabi/wabi2003.html#Addario-BerryCHLPW03
%V 2812
%@ 3-540-20076-2
@inproceedings{conf/wabi/Addario-BerryCHLPW03,
added-at = {2022-04-09T00:00:00.000+0200},
author = {Addario-Berry, Louigi and Chor, Benny and Hallett, Michael T. and Lagergren, Jens and Panconesi, Alessandro and Wareham, Todd},
biburl = {https://www.bibsonomy.org/bibtex/294fc7d4698b1e85f4364f2b39987f0b4/dblp},
booktitle = {WABI},
crossref = {conf/wabi/2003},
editor = {Benson, Gary and Page, Roderic D. M.},
ee = {https://doi.org/10.1007/978-3-540-39763-2_16},
interhash = {4d053981d895555d95b19b239d830154},
intrahash = {94fc7d4698b1e85f4364f2b39987f0b4},
isbn = {3-540-20076-2},
keywords = {dblp},
pages = {202-215},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
timestamp = {2024-04-10T20:34:54.000+0200},
title = {Ancestral Maximum Likelihood of Evolutionary Trees Is Hard.},
url = {http://dblp.uni-trier.de/db/conf/wabi/wabi2003.html#Addario-BerryCHLPW03},
volume = 2812,
year = 2003
}