Geometric Algorithms for the Analysis of 2D-Electrophoresis Gels
暂无分享,去创建一个
[1] Mark Jerrum,et al. Large Cliques Elude the Metropolis Process , 1992, Random Struct. Algorithms.
[2] Joseph C. Culberson,et al. Covering Polygons Is Hard , 1994, J. Algorithms.
[3] Carola Wenk,et al. An Applied Point Pattern Matching Problem: Comparing 2D Patterns of Protein Ppots , 1999, Discret. Appl. Math..
[4] Michael T. Goodrich,et al. Almost optimal set covers in finite VC-dimension , 1995, Discret. Comput. Geom..
[5] Hideo Ogawa. Labeled point pattern matching by Delaunay triangulation and maximal cliques , 1986, Pattern Recognit..
[6] J. Garrels. The QUEST system for quantitative analysis of two-dimensional gels. , 1989, The Journal of biological chemistry.
[7] R D Appel,et al. Melanie II – a third‐generation software package for analysis of two‐dimensional electrophoresis images: II. Algorithms , 1997, Electrophoresis.
[8] H Alt,et al. New algorithmic approaches to protein spot detection and pattern matching in two‐dimensional electrophoresis gel databases , 1999, Electrophoresis.
[9] Gerald Weber,et al. An Application of Point Pattern Matching in Astronautics , 1994, J. Symb. Comput..
[10] P. Lemkin. Comparing two‐dimensional electrophoretic gel images across the Internet , 1997, Electrophoresis.