Selective mapping: a discrete optimization approach to selecting a population subset for use in a high-density genetic mapping project

Authors:
Daniel G. Brown;Todd J. Vision;Steven D. Tanksley
Affiliations:
Department of Computer Science, Cornell University, Ithaca, NY;USDA-ARS Center for Bioinformatics and Comparative Genomics, Cornell University, Ithaca, NY;Department of Plant Breeding, Cornell University, Ithaca, NY
Venue:
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Year:
2000

Citing 3
Cited 1

Integer and combinatorial optimization

Integer and combinatorial optimization
Randomized rounding: a technique for provably good algorithms and algorithmic proofs

Combinatorica - Theory of Computing
Various notions of approximations: good, better, best, and more

Approximation algorithms for NP-hard problems

A probabilistic analysis of a greedy algorithm arising from computational biology

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract