A probabilistic analysis of a greedy algorithm arising from computational biology

Authors:
Daniel G. Brown
Affiliations:
Department of Computer Science, University of Waterloo, Waterloo, Ontario
Venue:
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Year:
2001

Citing 2
Cited 2

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

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Algorithmic methods in genetic mapping

Algorithmic methods in genetic mapping

Guarantees for the success frequency of an algorithm for finding Dodgson-election winners

Journal of Heuristics
Guarantees for the success frequency of an algorithm for finding dodgson-election winners

MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract