Trie-based data structures for sequence assembly

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1264, Issue , 1997, Pages 206-223

  Chen, Ting ^a   Skiena, Steven S ^a  

^a Stony Brook University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; DNA SEQUENCES; GENE ENCODING; LOGIC PROGRAMMING; PATTERN MATCHING; TREES (MATHEMATICS);

BROOKHAVEN NATIONAL LABORATORY; DNA SEQUENCING; FRAGMENT ASSEMBLY; HIGH-ACCURACY; OVERLAP DETECTIONS; SEQUENCE ASSEMBLIES; SPACE SAVINGS; TRIE-BASED DATA STRUCTURES;

DYNAMIC PROGRAMMING;

EID: 84948989459     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63220-4_61     Document Type: Conference Paper

References (16)

1. S.F. Altschal, W. Gish, W. Miller, E.W. Myers, and D.J. Lipman. Basic local alignment search tool. J. Mol. Biol., 215:403-410, 1990.
2. M Bellare, O. Goldreich, and M. Sudan. Free bits, PCPs, and non-approximahmty - towards tight results. In Proc. IEEB 36th Symp. Foundations of Computer Science, pages 422-431, 1995.
3. D.R. Clark and J.I. Munro. Efficient suffix trees on secondary storage. In Proc. Seventh ACM Symp. on Discrete Algorithms (SODA), pages 383-391, 1996.
4. S. Dawson, C.R. Ramakrislman, I.V. Bamakrlshnan, K. Sagonas, T. Swift, and D.S. Warren. Unification factoring for effcient execution of logic programs. In 2nd ACM Symposium on Principles of Programming Languages (POPL '95), pages 247-258, 1995.
5. S. Dawson, C.R. Ramakrislman, and T. Swift. Principles and practice of unification factoring. In ACM Trans. on Programming Languages (TOPLAS), pages 528-563, 1996.
6. M.L. Engle and C. Burks. Artificlal]y generated data sets for testing DNA fragment assembly algorithms. Genomics, 16:286-288, 1993.
7. P. Green. Documentation for phrap. Genome Center, University of Washington, http://bozeman.mbt.washington.edu, 1996.
8. J. Kececlogiu and E.W. Myers. Exact and approximate algorithms for the sequence reconstruction problem. Algorithmica, 13:5-51, 1995.
9. 2-complete. In Proc. 10th IEEB Steucture: in Complexity Theory Conference, pages 238-244, 1995.
10. C. Lund and M. Yans. The approximation of maximum subgraph problems. In Proc. 20th ICALP, pages 40-51, 1992.
11. U. Manber and E.W. Myers. Suffix arrays: A new method for on-llne string searches. SIAM J. Computing, 22:935-948, 1993.
12. E. W. Myers. Towards simplifying and accurateJy formulating fragment assembly. J. Comp. Biol, 2(2):275-290, 1995.
13. W.R. Pearson and D.J. Lipman. Improved took for biological sequence comparison. In Proc. Natl. Acad. Sci., pages 2444-2448, 1988.
14. H. Simon. On approximate solutions for combinatorial optimization problems. SIAM J. Discrete Math., 3:294-310, 1990.
15. G.G. Sutton, O. White, M.D. Admas, and A.R. Kerlsvage. TIGR assembler: a new tool for assembling large shotgun sequencing projects. Genome Science and Technology, 1-19, 1995.
16. M. S. Waterman. Introduction to Computational Biology. Chapman & HaU, London, UK, 1995