Jan 312012
 

HapBound / SHRUB

:: DESCRIPTION

HapBound and SHRUB respectively compute lower and upper bounds on the minimum number of crossover recombinations. SHRUB constructs an ancestral recombination graph for the input data.

::DEVELOPER

Yun S. Song

:: SCREENSHOTS

N/A

:: REQUIREMENTS

  • Linux/Windows with Cygwin /MacOsX

:: DOWNLOAD

 HapBound and SHRUB

:: MORE INFORMATION

Citation

Song, Y.S., Wu, Y. and Gusfield, D.
Efficient computation of close lower and upper bounds on the minimum number of recombinations in biological sequence evolution,
Bioinformatics 21, Suppl.1, (2005) i413-i422.

237 views

Sorry, the comment form is closed at this time.