Proceedings of the 2003 ACM Symposium on Applied Computing 2003
DOI: 10.1145/952532.952551
|View full text |Cite
|
Sign up to set email alerts
|

A Markov Random Field model of microarray gridding

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
12
0

Year Published

2005
2005
2023
2023

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 42 publications
(12 citation statements)
references
References 9 publications
0
12
0
Order By: Relevance
“…Such methods are implemented in ScanAlyze [1], ImaGene [2] or SpotFinder [3] that require several parameters to be set by the user. Only a few state of the art methods address the problem of unsupervised gridding based on methods such as mathematical morphology [4], Markov random fields [5], Voronoi diagrams [6,7], Bayesian grid matching [8], Gaussian mixture model [9], genetic algorithms [10] or a combination of approaches [11].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Such methods are implemented in ScanAlyze [1], ImaGene [2] or SpotFinder [3] that require several parameters to be set by the user. Only a few state of the art methods address the problem of unsupervised gridding based on methods such as mathematical morphology [4], Markov random fields [5], Voronoi diagrams [6,7], Bayesian grid matching [8], Gaussian mixture model [9], genetic algorithms [10] or a combination of approaches [11].…”
Section: Introductionmentioning
confidence: 99%
“…For example, the method proposed in [4] requires that grid rows and columns are strictly aligned with the x and y axes, the region segmentation approach proposed in [5] fails to detect many weak signal spots and in [11] the number of rows and columns of spots per grid is required. The method presented in [8] employs an iterative algorithm to solve a complex deformable model for microarray gridding, but simple linear models such as [10] have been shown to achieve high accuracy.…”
Section: Introductionmentioning
confidence: 99%
“…Only a few state of the art methods address the problem of automatic gridding. Such methods are based on mathematical morphology [3], Markov random fields [4], Voronoi diagrams [5], Bayesian grid matching [6], genetic algorithms [7] or a combination of approaches [8]. However, there are still problems that have to be resolved before fully automatic gridding can take place.…”
Section: Introductionmentioning
confidence: 99%
“…However, there are still problems that have to be resolved before fully automatic gridding can take place. For example, the method proposed in [3] requires that grid rows and columns are strictly aligned with the x and y axes; the region segmentation approach proposed in [4] fails to detect many weak signal spots; in [8], the number of rows and columns of spots per grid is required; the method proposed in [6] is quite complex; and the genetic approach [7] is very timeconsuming.…”
Section: Introductionmentioning
confidence: 99%
“…Dapple's techniques are useful for improving the accuracy of data acquisition from DNA microarrays [6] . Mathias, Franz & Gerhard proposed microarray technology and MRF model of microarray gridding that is designed to integrate different application specific constraints and heuristic criteria into a robust and flexible segmentation algorithm [7] . Also there were other researchers who tried to fined deferent ways for gridding for example.…”
Section: Introductionmentioning
confidence: 99%