Geometric algorithms for the analysis of 2D-electrophoresis gels

Proceedings of the Annual International Conference on Computational Molecular Biology, RECOMB

Volumn , Issue , 2001, Pages 114-123

  Efrat, A ^a   Hoffmann, F ^a   Kriegel, K ^a   Schultz, C ^a   Wenk, C ^a  

^a University of Arizona   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CLIENT SERVER COMPUTER SYSTEMS; ELECTROPHORESIS; IMAGE ANALYSIS; INTERNET; PROTEINS;

ELECTROPHORESIS GELS;

GELS;

EID: 0034826947     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/369133.369181     Document Type: Conference Paper

References (24)

1. Covering points by strips in the plane
2. Discrete geometric shapes: Matching, interpolation, and approximation, A survey
3. Point pattern matching in astronautics
4. Hardness of set cover with intersection 1
5. Melanie II, A third-generation software package for analysis of two-dimensional electrophoresis images: II. Algorithms
6. Almost optimal set covers in finite VC-dimension
7. The QUEST system for quantitative analysis of 2D gels
8. Randomized incremental construction of Delaunay and Voronoi diagrams
9. Taking a walk in a planar arrangement
10. An applied pattern matching problem: Comparing 2D patterns of protein spots
11. Combinatorial and experimental results for randomized point matching algorithms
12. Large cliques elude the metropolis process
13. An alternative approach to deal with geometric uncertainties in computer analysis of two-dimensional electrophoresis gels
14. Labeled point pattern matching by delaunay triangulation and maximal cliques
15. Comparing two-dimensional electrophoretic gel images across the Internet
16. New algorithmic approaches to protein spot detection and pattern matching in two-dimensional electrophoresis gel databases
17. Backwards analysis of randomized geometric constructions