Abstract
The reconstruction of an unknown target sequence from the collection of its subsequences is a problem originating in computational biology (sequencing by hybridization), but with combinatorial significance in its own right. Retracing the history of the topic, this paper explores the power of the subsequence pattern in extracting information from the target, and proposes a new class of effective patterns, named self-matched, characterized by their autocorrelation function.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bains, W., Smith, G.C.: A novel method for DNA sequence determination. Jour. of Theoretical Biology 135, 303–307 (1988)
Drmanac, R., Labat, I., Bruckner, I., Crkvenjakov, R.: Sequencing of megabase plus DNA by hybridization. Genomics 4, 114–128 (1989)
Loakes, D., Brown, D.M.: 5-Nitroindole as a universal base analogue. Nucleic Acids Research 22(20), 4039–4043 (1994)
Lysov, Y.P., Florentiev, V.L., Khorlin, A.A., Khrapko, K.R., Shih, V.V., Mirzabekov, A.D.: Sequencing by hybridization via oligonucleotides. A novel method. Dokl. Acad. Sci. USSR 303, 1508–1511 (1988)
Pevzner, P.A.: l-tuple DNA sequencing: computer analysis. Journ. Biomolecul. Struct. & Dynamics 7(1), 63–73 (1989)
Pevzner, P.A., Lipshutz, R.J.: Towards DNA-sequencing by hybridization. In: Privara, I., Ružička, P., Rovan, B. (eds.) MFCS 1994. LNCS, vol. 841, pp. 143–258. Springer, Heidelberg (1994)
Preparata, F.P., Upfal, E.: Sequencing-by-Hybridization at the information-theory bound: An optimal algorithm. Journal of Computational Biology 7(3/4), 621–630 (2000)
Preparata, F.P., Upfal, E., Heath, S.A.: Sequence reconstruction from nucleic acid micro-array data. In: Nunnally, B. (ed.) Analytic techniques for DNA sequencing, pp. 177–193. M. Dekker, New York (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Preparata, F.P. (2009). Self-matched Patterns, Golomb Rulers, and Sequence Reconstruction. In: Albers, S., Alt, H., Näher, S. (eds) Efficient Algorithms. Lecture Notes in Computer Science, vol 5760. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03456-5_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-03456-5_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03455-8
Online ISBN: 978-3-642-03456-5
eBook Packages: Computer ScienceComputer Science (R0)