Publication no #443   Type :   Html | Bib | Both
Created: 2007-11-17 01:16:42     Modified: 2008-04-04 08:22:09
443
photophoto
Dan Gusfield and Dean Hickerson. A Fundamental, Efficiently-Computed Lower Bound on the Number of Recombinations Needed in Phylogenetic Networks. 2004.
Note: UC Davis Computer Science Technical Report.
       

  Authors  Community  Keywords  Publications  Software  Browse  Basket  Account  Contribute!  About  Help   

Website based on BibAdmin - forked on GitHub.
More details on the people involved in the development of the website available here.

In accordance with the European General Data Protection Regulation, you may
request information about your personal data processed on this website, or demand its correction or deletion
by contacting Philippe Gambette, the administrator of this website.

To refer to this website, please cite:
Tushar Agarwal, Philippe Gambette & David Morrison (2016),
Who is Who in Phylogenetic Networks: Articles, Authors and Programs,
https://arxiv.org/abs/1610.01674, website available at http://phylnet.univ-mlv.fr.