{x 1, x 2,..., x P
|
Abstract:
1 In this paper, we propose a graph-theoretic problem concerned with embedding its vertices on a real line in such a manner that the pair-wise distance measurements among the vertices are "preserved. " We study a wide class of distributions for the distance measurements and suggest several algorithms that solve it with high accuracy and good e#ciency. While the general problem has many diverse applications to genomics and other areas of biology, here we focus on one problem where the distance metric is inferred from a set of micro array experiments using short unique oligoes ( probes) from a genome hybridized to pooled fluorochrome-labeled clones ( e.g. BACs) from a large library from the same genome. Our probabilistic analysis and algorithms, in addition to solving the problem of placing probes along the genome, also give many insights as to how the experiments are to be designed. Our initial experience based on simulation is very promising and is reported here. 1 What
Citations
| 2003 | The Design and Analysis of Computer Algorithms – Aho, Hopcroft, et al. - 1974 |
| 10 | Data Structures and Network Algorithms, CBMS 44 – Tarjan - 1983 |
| 7 | Genomics: The Science and Technology Behind the Human Genome Project – Cantor, Smith - 1999 |
| 6 | A measure of asymptotic eciency for tests of a hypothesis based on the sum of observations – Chernoff - 1952 |
| 1 | Wigler "Detecting Gene Copy Number Fluctuations in Tumor Cells by Microarray Analysis of Genomic Representations," Genome Research – Lucito, West, et al. - 2000 |
| 1 | Wigler "Cloning the di#erences between tow complex genomes – Lisitsyn, M |
| 1 | Wigler "Genetic analysis using genomic representations – Lucito, Nakimura, et al. |
