blogtng:2010-05-14:marriage_matching_algorithm
Differences
This shows you the differences between two versions of the page.
| Next revision | Previous revision | ||
| blogtng:2010-05-14:marriage_matching_algorithm [2010/05/14 13:06] – created kota | blogtng:2010-05-14:marriage_matching_algorithm [2016/05/24 12:46] (current) – external edit 127.0.0.1 | ||
|---|---|---|---|
| Line 2: | Line 2: | ||
| Consider that we have probe 1 and 2 labeling some molecule as dots, and for each cell we have several signals for each probe, cf. 3 dots for probe 1 and 2 dots for probe 2. The we have an assignment that we want to pair them each, leaving one probe 1 dot unpaired (cf. In my case I know that a probe 1 dot and a probe 2 dot are on a same chromosome.) What would be the algorithm? | Consider that we have probe 1 and 2 labeling some molecule as dots, and for each cell we have several signals for each probe, cf. 3 dots for probe 1 and 2 dots for probe 2. The we have an assignment that we want to pair them each, leaving one probe 1 dot unpaired (cf. In my case I know that a probe 1 dot and a probe 2 dot are on a same chromosome.) What would be the algorithm? | ||
| + | |||
| + | In broader sense, this is a [[http:// | ||
| One way is to construct a cost function, such as "sum of distace between paired", | One way is to construct a cost function, such as "sum of distace between paired", | ||
blogtng/2010-05-14/marriage_matching_algorithm.1273842403.txt.gz · Last modified: 2016/05/24 12:46 (external edit)