Publication no #541   Type :   Html | Bib | Both
Created: 2007-11-17 01:16:45     Modified: 2018-08-17 16:24:06
541
photophotophoto
Yun S. Song, Yufeng Wu and Dan Gusfield. Efficient computation of close lower and upper bounds on the minimum number of recombinations in biological sequence evolution. In ISMB05, Vol. 21:i413-i422 of BIO, 2005.
Keywords: integer linear programming, minimum number, Program HapBound, Program SHRUB, recombination.
Note: http://dx.doi.org/10.1093/bioinformatics/bti1033.
       
Toggle abstract

@InProceedings{SWG2005,
      AUTHOR = {Song, Yun S. and Wu, Yufeng and Gusfield, Dan},
      TITLE = {Efficient computation of close lower and upper bounds on the minimum number of recombinations in biological sequence evolution},
      YEAR = {2005},
      BOOKTITLE = {ISMB05},
      VOLUME = {21},
      PAGES = {i413-i422},
      SERIES = {BIO},
      URL = {http://dx.doi.org/10.1093/bioinformatics/bti1033},
      NOTE = {http://dx.doi.org/10.1093/bioinformatics/bti1033},
      ANNOTE = {BIBUPDATE : 20070918},
      KEYWORDS = {integer linear programming, minimum number, Program HapBound, Program SHRUB, recombination}
}