Abstract
In the STS-based mapping, we are requested to obtain the correct order of probes in a DNA sequence from a given set of fragments or equivalently a hybridization matrix A. It is well-known that the problem is formulated as the combinatorial problem of obtaining a permutation of A’s columns so that the resulting matrix has the consecutive-one property. If the data (the hybridization matrix) is error free and includes enough information, then the above column order determines the correct order of the probes uniquely. Unfortunately this is no longer true if the data include errors, which has been one of the popular research targets in computational biology. Even if there is no error, ambiguities in the probe order may still remain. This in fact happens by the lack of some information of the data, but almost no further investigation was made previously. In this paper, we define a measure of such imperfectness of the data as a minimum amount of additional fragments which are needed to fix the probe order uniquely. Several polynomial-time algorithms to compute such additional fragments of minimum cost are presented.
Chapter PDF
References
M. T. Hajiaghayi and Y. Ganjali, A note on consecutive ones submatrix problem, Information processing letters 83, pp. 163–166, 2002
S. Heber, J. Hoheisel, and M. Vingron, Application of bootstrap techniques to physical mapping, Genomics 69, pp235–241, 2000
F. Alizadeh, R. M. Karp, D. K. Weisser, and G. Zweig, Physical mapping of chromosomes using unique probes, Symposium on Discrete Algorithms, pp. 489–500, 1994
J. Krececioglu, S. Shete, and J. Arnold, Reconstructing distances in physical maps of chromosomes with nonoverlapping probes, Proceedings of the fourth annual international conference on Computational molecular biology, pp. 183–192, 2000
F. S. Annexstein and R. P. Swaminathan, On testing consecutive-ones property in parallel, Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures, pp. 234–243, 1995
M. Jain and E. W. Myers, Algorithms for computing and integrating physical maps using unique probes, Proceedings of the first annual international conference on Computational molecular biology, pp. 151–161, 1997
T. Christof and J. Kececioglu, Computing physical maps of chromosomes with nonover-lapping probes by branch-and-cut, Proceedings of the third annual international conference on Computational molecular biology, pp. 115–123, 1999
R. Beigel, N. Alon, S. Kasif, M. S. Apaydin, and L. Fortnow, An optimal procedure for gap closing in whole genome shotgun sequencing, Proceedings of the fifth annual international conference on Computational biology, pp. 22–30 2001
T. Christof, M. Jnger, J. Kececioglu, P. Mutzel, and G. Reinelt, A branch-and-cut approach to physical mapping with end-probes, Proceedings of the first annual international conference on Computational molecular biology, pp. 84–92, 1997
D. B. Wilson, D. S. Greenberg, and C. A. Phillips, Beyond islands (extended abstract): Runs in clone-probe matrices, Proceedings of the first annual international conference on Computational molecular biology, pp. 320–329, 1997
A. Ben-Dor and B. Chor, On constructing radiation hybrid maps (extended abstract), Proceedings of the first annual international conference on Computational molecular biology, pp. 17–26, 1997
K. S. Booth and G. S. Lueker, Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms, Journal of Computer and System Sciences 13, pp. 335–379, 1976.
A.V. Aho, J.E. Hopcraft, and J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Mass., 1974.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer Science + Business Media, Inc.
About this paper
Cite this paper
Ito, H., Iwama, K., Tamura, T. (2004). Imperfectness of Data for STS-Based Physical Mapping. In: Levy, JJ., Mayr, E.W., Mitchell, J.C. (eds) Exploring New Frontiers of Theoretical Informatics. IFIP International Federation for Information Processing, vol 155. Springer, Boston, MA. https://doi.org/10.1007/1-4020-8141-3_23
Download citation
DOI: https://doi.org/10.1007/1-4020-8141-3_23
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4020-8140-8
Online ISBN: 978-1-4020-8141-5
eBook Packages: Springer Book Archive