论文信息 - Reconstructing Strings from Substrings (Extended Abstract) - 字舞流文

Reconstructing Strings from Substrings (Extended Abstract)

Steven Skiena | Gopalakrishnan Sundaram | S. Skiena | G. Sundaram

[1] Steven Skiena,et al. Decision trees for geometric models , 1993, SCG '93.

[2] P. Pevzner,et al. Improved chips for sequencing by hybridization. , 1991, Journal of biomolecular structure & dynamics.

[3] S. P. Fodor,et al. Light-directed, spatially addressable parallel chemical synthesis. , 1991, Science.

[4] P. Pevzner. 1-Tuple DNA sequencing: computer analysis. , 1989, Journal of biomolecular structure & dynamics.

[5] W. Bains,et al. A novel method for nucleic acid sequence determination. , 1988, Journal of theoretical biology.

[6] Herbert S. Wilf,et al. Strings, substrings, and the nearest integer function , 1988 .

[7] Herbert S. Wilf,et al. The Editor's Corner: Strings, Substrings, and the ‘Nearest Integer’ Function , 1987 .

[8] Bernard M. E. Moret,et al. Decision Trees and Diagrams , 1982, CSUR.

[9] Leonidas J. Guibas,et al. String Overlaps, Pattern Matching, and Nontransitive Games , 1981, J. Comb. Theory, Ser. A.

[10] Christos H. Papadimitriou,et al. On the complexity of edge traversing , 1976, J. ACM.

[11] Ronald L. Rivest,et al. Constructing Optimal Binary Decision Trees is NP-Complete , 1976, Inf. Process. Lett..

[12] Jack Edmonds,et al. Matching, Euler tours and the Chinese postman , 1973, Math. Program..

[13] I. Good. Normal Recurring Decimals , 1946 .