Name
Abstract | ||
|---|---|---|
The large numbers of markers in high-resolution radiation hybrid (RH) maps, increasingly necessitates the use of data mining techniques for reducing both the computational complexity and the impact of noise of the original data. Traditionally, the RH mapping process has been treated as equivalent to the traveling salesman problem, with the correspondingly high computational complexity. These techniques are also susceptible to noise, and unreliable marker can result in major disruptions of the overall order. In this paper, we propose a new approach that recognizes that the focus on nearest-neighbor distances that characterizes the traveling-salesman model, is no longer appropriate for the large number of markers in modern high-resolution mapping experiments. The proposed approach splits the mapping process into two levels, where the higher level only operates on the most stable markers of the lower level. A divide and conquer strategy, which is applied at the lower level, removes much of the impact of noise. Because of the high density of markers, only the most stable representatives from the lower level are then used at the higher level. The groupings within the lower level are so small that exhaustive search can be used. Markers are then mapped iteratively, while excluding problematic markers. The results for RH mapping dataset of the human genome show that the proposed approach can construct high-resolution maps with high agreement with the physical maps in a comparatively very short time. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1145/2649387.2649443 | BCB |
Keywords | Field | DocType |
algorithms,noisy datasets,high-resolution maps,radiation hybrid mapping,reliability,data mining,bioinformatics,performance,clustering | Brute-force search,Computer science,High density,Travelling salesman problem,Divide and conquer algorithms,Bioinformatics,Cluster analysis,Radiation hybrid mapping,Radiation Hybrid Maps,Computational complexity theory | Conference |
Citations | PageRank | References |
0 | 0.34 | 7 |
Authors | ||
6 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Raed I. Seetan | 1 | 4 | 1.88 |
| Anne M. Denton | 2 | 94 | 10.96 |
| Omar Al Azzam | 3 | 5 | 2.57 |
| Ajay Kumar | 4 | 4 | 1.88 |
| Muhammad Javed Iqbal | 5 | 1 | 1.37 |
| Shahryar F. Kianian | 6 | 8 | 2.73 |