This work was partially supported by NSF Research Initiation Award CCR-9109289, New York State Science and Technology Foundation Grant RDG-90171, and an ONR Young Investigator Award.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
E. Arkin, J. Mitchell, H. Meijer, D. Rappapoit, and S. Skiena. Decision trees for geometric objects. In Ninth ACM Symp. Computational Geometry, 1993.
W. Bains and G. Smith. A novel method fox nucleic acid sequence determination. J. Theor. Biol., 135:303–307, 1988.
R. Dramanac and R. Crkvenjakov. DNA sequencing by hybridization. Yugoslav Patent Application 570, 1987.
J. Edmonds and E. Johnson. Matching, Euler tours, and the Chinese postman problem. Math. Prog., 5:88–124, 1973.
S. Fodor, J. Read, M. Pirrung, L. Stryer, A. Lu, and D. Solas. Light-directed, spatially addressable parallel chemical synthesis. Science, 251:767–773, 1991.
I. J. Good. Normal recurring decimals. J. London Math. Soc., 21:167–172, 1946.
L. Guibas and A. Odlyzko. String overlaps, pattern matching, and non-transitive games. J. Combinatorial Theory (Series A), 23:183–208, 1981.
L. Hyafil and R. Rivest. Constructing optimal binary decision trees is NP-complete. Information Processing Letters, 5:15–17, 1976.
M.-K. Kwan. Graphic programming using odd and even points. Chinese Math., 1:273–277, 1962.
Y. Lysov, V. Florent'ev, A. Khorlin, K. Khrapko, V. Shik, and A. Mirzabekov. Dokl. Acad. Sci. USSR, 303:1508, 1988.
B. Moret. Decision trees and diagrams. Computing Surveys, pages 593–623, 1982.
C. Papadimitriou. The complexity of edge traversing. J. ACM, 23:544–554, 1976.
P. Pevzner, Y. Lysov, K. Khrapko, A. Belyavski, V. Florentiev, and A. Mizabelkov. Improved chips for sequencing by hybridization. J. Biomolecular Structure and Dynamics, 9:399–410, 1991.
P. A. Pevzner and R. J. Lipshutz. Towards DNA sequencing by hybridization. Submitted for publication, 1992.
P.A. Pevzner. l-tuple DNA sequencing: Computer analysis. J. Biomolecular Structure and Dynamics, 7:63–73, 1989.
H. Wilf. Strings, substrings, and the nearest integer function. Amer. Math. Monthly, 94:855–860, 1987.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Skiena, S.S., Sundaram, G. (1993). Reconstructing strings from substrings (Extended abstract). In: Dehne, F., Sack, JR., Santoro, N., Whitesides, S. (eds) Algorithms and Data Structures. WADS 1993. Lecture Notes in Computer Science, vol 709. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57155-8_280
Download citation
DOI: https://doi.org/10.1007/3-540-57155-8_280
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57155-1
Online ISBN: 978-3-540-47918-5
eBook Packages: Springer Book Archive