A probabilistic analysis of a greedy algorithm arising from computational biology

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2001, Pages 206-

  Brown, Daniel G ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Algorithms; Human factors; Measurement; Performance; Theory; Verification

Indexed keywords

EID: 20444376046     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (5)

1. N. Alon, R. Boppana, and J. Spencer. An asymptotic isoperimetric inequality. Geometric and functional analysis, 8:411-436, 1998.
2. Daniel Gregory Brown , David B. Schmoys, Algorithmic methods in genetic mapping, Cornell University, Ithaca, NY, 2000
3. Daniel G. Brown , Todd J. Vision , Steven D. Tanksley, Selective mapping: a discrete optimization approach to selecting a population subset for use in a high-density genetic mapping project, Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, p.419-428, January 09-11, 2000, San Francisco, California, United States
4. S. B. Primrose. Principles of Genome Analysis. Blackwell Science, Oxford, 1998.
5. T. J. Vision, D. G. Brown, D. B. Shmoys, R. T. Durrett, and S. D. Tanksley. Selective mapping: a strategy for optimizing the construction of high-density linkage maps. Genetics, 155:407-420, 2000.