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.
Advertisement
::DEVELOPER
:: SCREENSHOTS
N/A
:: REQUIREMENTS
- Linux/Windows with Cygwin /MacOsX
:: DOWNLOAD
:: 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.