%0 Conference Paper %1 conf/recomb/ChorT05 %A Chor, Benny %A Tuller, Tamir %B RECOMB %D 2005 %E Miyano, Satoru %E Mesirov, Jill P. %E Kasif, Simon %E Istrail, Sorin %E Pevzner, Pavel A. %E Waterman, Michael S. %I Springer %K dblp %P 296-310 %T Maximum Likelihood of Evolutionary Trees Is Hard. %U http://dblp.uni-trier.de/db/conf/recomb/recomb2005.html#ChorT05 %V 3500 %@ 3-540-25866-3

@inproceedings{conf/recomb/ChorT05, added-at = {2019-05-13T00:00:00.000+0200}, author = {Chor, Benny and Tuller, Tamir}, biburl = {https://www.bibsonomy.org/bibtex/2fc3858c0577543dde1d2e6953c0fe488/dblp}, booktitle = {RECOMB}, crossref = {conf/recomb/2005}, editor = {Miyano, Satoru and Mesirov, Jill P. and Kasif, Simon and Istrail, Sorin and Pevzner, Pavel A. and Waterman, Michael S.}, ee = {https://doi.org/10.1007/11415770_23}, interhash = {b808dfc1c2bc23b3b35fffb5d90d7c4b}, intrahash = {fc3858c0577543dde1d2e6953c0fe488}, isbn = {3-540-25866-3}, keywords = {dblp}, pages = {296-310}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-05-14T11:38:54.000+0200}, title = {Maximum Likelihood of Evolutionary Trees Is Hard.}, url = {http://dblp.uni-trier.de/db/conf/recomb/recomb2005.html#ChorT05}, volume = 3500, year = 2005 }