%0 Conference Paper %1 Bryant99a %A Bryant, David %A Steel, Mike %B Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms (Baltimore, MD, 1999) %C New York %D 1999 %I ACM %K from:davidjamesbryant %P 147--155 %T Fast algorithms for constructing optimal trees from quartets

@inproceedings{Bryant99a, added-at = {2009-01-28T01:17:14.000+0100}, address = {New York}, author = {Bryant, David and Steel, Mike}, biburl = {https://www.bibsonomy.org/bibtex/268d543af40f431c77e881e4dafc783fb/compevol}, booktitle = {Proceedings of the {T}enth {A}nnual {ACM}-{SIAM} {S}ymposium on {D}iscrete {A}lgorithms ({B}altimore, {MD}, 1999)}, date-added = {2009-01-28 12:07:05 +1300}, date-modified = {2009-01-28 13:04:38 +1300}, interhash = {ad9bdc5edddf7e81f48c5f4fb7da43c3}, intrahash = {68d543af40f431c77e881e4dafc783fb}, keywords = {from:davidjamesbryant}, mrclass = {92D15 (68W40)}, mrnumber = {MR1739941}, pages = {147--155}, publisher = {ACM}, timestamp = {2009-01-28T01:29:25.000+0100}, title = {Fast algorithms for constructing optimal trees from quartets}, year = 1999 }