add algorithms.lpsolve.tsp() to solve Traveling Salesman Problem
use one fewer general variables in algorithms.lpsolve.tsp()
implement DFJ constraints in algorithms.lpsolve.tsp()
use concorde to solve scaffold order
remove distance threshold in assembly.geneticmap.ScaffoldOO
determine orientations in assembly.geneticmap.path()
add algorithms.tsp.demo() to plot results of hamiltonian()
add assembly.pbjelly.spancount()
make assembly.geneticmap.path() work on single genetic map as well
implement ATSP in algorithms.tsp
try to autoscale weights in algorithms.tsp
fix scaling in algorithms.tsp
weight the sign array in assembly.geneticmap with # markers per scaffold
Updated psl2gff converter to handle the conversion of coordinates of negative strand target hits
add Maria to author list
write linkage as "map" in assembly.geneticmap.path()