Abstract
An important problem in physical mapping is to test the consecutive ones property of a (0,1)-matrix: that is, whether it is possible to permute the columns so that each row of the resulting matrix has the ones occur in a consecutive block. This is useful for DNA sequence assembly, for example, in probe hybridization. for cosmid clones and in the STS content mapping of YAC library. The linear time algorithm by Booth and Lueker (1975) for this problem has a serious drawback: the data must be error-free. However, laboratory work is never flawless. We devised a new algorithm for this problem, which has the following advantages:
-
1.
conceptually, it is very simple;
-
2.
it produces a matrix satisfying the consecutive ones property in linear time when the matrix satisfies the consecutive ones property;
-
3.
with reasonable assumptions, it can accommodate the following three types of errors in physical mapping: false negatives, false positives and chimeric clones;
-
4.
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.
Preview
Unable to display preview. Download preview PDF.
References
F. Alizadeh, R. M. Karp, D. K. Weisser, and G. Zweig, Physical mapping of chromosomes using unique probes, Proc. 5th SODA, (1994), 489–500.
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.
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.
W. L. Hsu, A simple test for the consecutive ones property, Lecture Notes in Computer Science 650, (1992), 459–468.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hsu, WL. (1997). On physical mapping algorithms: An error-tolerant test for the consecutive ones property. In: Jiang, T., Lee, D.T. (eds) Computing and Combinatorics. COCOON 1997. Lecture Notes in Computer Science, vol 1276. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0045091
Download citation
DOI: https://doi.org/10.1007/BFb0045091
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63357-0
Online ISBN: 978-3-540-69522-6
eBook Packages: Springer Book Archive