Publication no #437   Type :   Html | Bib | Both
Created: 2007-11-17 01:16:42     Modified: 2016-06-30 01:27:02
437
photophotophoto
Dan Gusfield, Dean Hickerson and Satish Eddhu. An efficiently computed lower bound on the number of recombinations in phylogenetic networks: Theory and empirical study. In DAM, Vol. 155(6-7):806-830, 2007.  
Note: http://wwwcsif.cs.ucdavis.edu/~gusfield/cclowerbound.pdf.
       
Toggle abstract