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.
@Misc{GusfieldHickerson2004,
AUTHOR = {Gusfield, Dan and Hickerson, Dean},
TITLE = {A Fundamental, Efficiently-Computed Lower Bound on the Number of Recombinations Needed in Phylogenetic Networks},
YEAR = {2004},
NOTE = {UC Davis Computer Science Technical Report},
ANNOTE = {BIBUPDATE : 20070914} }
|