{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T09:07:12Z","timestamp":1758272832459,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540632207"},{"type":"electronic","value":"9783540692140"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63220-4_61","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T23:19:38Z","timestamp":1330298378000},"page":"206-223","source":"Crossref","is-referenced-by-count":8,"title":["Trie-based data structures for sequence assembly"],"prefix":"10.1007","author":[{"given":"Ting","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steven S.","family":"Skiena","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1016\/S0022-2836(05)80360-2","volume":"215","author":"S.F. Altschul","year":"1990","unstructured":"S.F. Altschul, W. Gish, W. Miller, E.W. Myers, and D.J. Lipman. Basic local alignment search tool. J. Mol. Biol., 215:403\u2013410, 1990.","journal-title":"J. Mol. Biol."},{"doi-asserted-by":"crossref","unstructured":"M Bellare, O. Goldreich, and M. Sudan. Free bits, PCPs, and non-approximability \u2014 towards tight results. In Proc. IEEE 36th Symp. Foundations of Computer Science, pages 422\u2013431, 1995.","key":"17_CR2","DOI":"10.1109\/SFCS.1995.492573"},{"unstructured":"D.R. Clark and J.I. Munro. Efficient suffix trees on secondary storage. In Proc. Seventh ACM Symp. on Discrete Algorithms (SODA), pages 383\u2013391, 1996.","key":"17_CR3"},{"doi-asserted-by":"crossref","unstructured":"S. Dawson, C.R. Ramakrishnan, I.V. Ramakrishnan, K. Sagonas, T. Swift, and D.S. Warren. Unification factoring for efficient execution of logic programs. In 2nd ACM Symposium on Principles of Programming Languages (POPL '95), pages 247\u2013258, 1995.","key":"17_CR4","DOI":"10.1145\/199448.199509"},{"doi-asserted-by":"crossref","unstructured":"S. Dawson, C.R. Ramakrishnan, and T. Swift. Principles and practice of unification factoring. In ACM Trans. on Programming Languages (TOPLAS), pages 528\u2013563, 1996.","key":"17_CR5","DOI":"10.1145\/232706.232722"},{"key":"17_CR6","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1006\/geno.1993.1180","volume":"16","author":"M.L. Engle","year":"1993","unstructured":"M.L. Engle and C. Burks. Artificially generated data sets for testing DNA fragment assembly algorithms. Genomics, 16:286\u2013288, 1993.","journal-title":"Genomics"},{"unstructured":"P. Green. Documentation for phrap. Genome Center, University of Washington, http:\/\/bozeman.mbt.washington.edu, 1996.","key":"17_CR7"},{"key":"17_CR8","first-page":"5","volume":"13","author":"J. Kececioglu","year":"1995","unstructured":"J. Kececioglu and E.W. Myers. Exact and approximate algorithms for the sequence reconstruction problem. Algorithmica, 13:5\u201351, 1995.","journal-title":"Algorithmica"},{"unstructured":"C.-L. Lin. Optimizing tries for ordered pattern matching is \u03c0 2 p -complete. In Proc. 10th IEEE Structures in Complexity Theory Conference, pages 238\u2013244, 1995.","key":"17_CR9"},{"doi-asserted-by":"crossref","unstructured":"C. Lund and M. Yannakakis. The approximation of maximum subgraph problems. In Proc. 20th ICALP, pages 40\u201351, 1992.","key":"17_CR10","DOI":"10.1007\/3-540-56939-1_60"},{"key":"17_CR11","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1137\/0222058","volume":"22","author":"U. Manber","year":"1993","unstructured":"U. Manber and E.W. Myers. Suffix arrays: A new method for on-line string searches. SIAM J. Computing, 22:935\u2013948, 1993.","journal-title":"SIAM J. Computing"},{"issue":"2","key":"17_CR12","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1089\/cmb.1995.2.275","volume":"2","author":"E. W. Myers","year":"1995","unstructured":"E. W. Myers. Towards simplifying and accurately formulating fragment assembly. J. Comp. Biol., 2(2):275\u2013290, 1995.","journal-title":"J. Comp. Biol."},{"doi-asserted-by":"crossref","unstructured":"W.R. Pearson and D.J. Lipman. Improved tools for biological sequence comparison. In Proc. Natl. Acad. Sci., pages 2444\u20132448, 1988.","key":"17_CR13","DOI":"10.1073\/pnas.85.8.2444"},{"key":"17_CR14","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1137\/0403025","volume":"3","author":"H. Simon","year":"1990","unstructured":"H. Simon. On approximate solutions for combinatorial optimization problems. SIAM J. Discrete Math., 3:294\u2013310, 1990.","journal-title":"SIAM J. Discrete Math."},{"key":"17_CR15","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1089\/gst.1995.1.9","volume":"1","author":"G.G. Sutton","year":"1995","unstructured":"G.G. Sutton, O. White, M.D. Admas, and A.R. Kerlavage. TIGR assembler: a new tool for assembling large shotgun sequencing projects. Genome Science and Technology, 1:9\u201319, 1995.","journal-title":"Genome Science and Technology"},{"key":"17_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4899-6846-3","volume-title":"Introduction to Computational Biology","author":"M. S. Waterman","year":"1995","unstructured":"M. S. Waterman. Introduction to Computational Biology. Chapman & Hall, London, UK, 1995."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63220-4_61.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T23:40:26Z","timestamp":1742600426000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63220-4_61"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540632207","9783540692140"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-63220-4_61","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}