On physical mapping algorithms: An error-tolerant test for the consecutive ones property
conceptually, it is very simple;
it produces a matrix satisfying the consecutive ones property in linear time when the matrix satisfies the consecutive ones property;
with reasonable assumptions, it can accommodate the following three types of errors in physical mapping: false negatives, false positives and chimeric clones;
in the rare case that the assumptions in 3 are not satisfied, our algorithm would suggest additional lab work that could reduce the degree of ambiguity.
Unable to display preview. Download preview PDF.
- 1.F. Alizadeh, R. M. Karp, D. K. Weisser, and G. Zweig, Physical mapping of chromosomes using unique probes, Proc. 5th SODA, (1994), 489–500.Google Scholar
- 2.F. Alizadeh, R. M. Karp, L. A. Newberg, and D. K. Weisser, Physical mapping of chromosomes: A combinatorial problem in molecular biology, Algorithmica 13, (1995), 52–76.Google Scholar
- 3.K. S. Booth and G. S. Lueker, Testing of the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms, J. Comptr. Syst. Sci. 13, 3 (1976), 335–379.Google Scholar
- 4.W. L. Hsu, A simple test for the consecutive ones property, Lecture Notes in Computer Science 650, (1992), 459–468.Google Scholar