Parallel EST clustering

Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2002

Volumn , Issue , 2002, Pages 185-

  Kalyanaraman, A ^a   Aluru, S ^a   Kothari, S ^a  

^a IOWA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 23844449218     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2002.1016587     Document Type: Conference Paper

References (15)

1. S. Altschul, W. Gish, W. Miller, E. Myers, and D. Lipman. Basic local alignment search tool. Journal of Molecular Biology, 215:403-410, 1990.
2. A. Apostolico, C. Iliopoulos, G. M. Landau, B. Schieber, and U. Vishkin. Parallel construction of a suffix tree with applications. Algorithmica, 3:347-365, 1988.
3. P. Green. http://www.mbt.washington.edu/phrap.docs/phrap.html, 1996.
4. D. Gusfield. Algorithms on strings, trees and sequences: computer science and computational biology. Cambridge University Press, Cambridge, London, 1997.
5. R. Hariharan. Optimal parallel suffix tree construction. Journal of Computer and System Sciences, 55(1):44-69, 1997.
6. X. Huang and A. Madan. CAP3: A DNA sequence assembly program. Genome Research, 9(9):868-877, 1999.
7. F. Liang, I. Holt, G. Pertea, S. Karamycheva, S. Salzberg, and J. Quackenbush. An optimized protocol for analysis of EST sequences. Nucleic Acids Research, 28(18):3657-3665, 2000.
8. E. McCreight. A space economical suffix tree construction algorithm. Journal of the ACM, 23:262-272, 1976.
9. S. Needleman and C. Wunsch. A general method applicable to the search for similarities in the amino acid sequence of two proteins. Journal of Molecular Biology, 48:443-453, 1970.
10. W. Pearson and D. Lipman. Improved tools for biological sequence comparison. Proc. National Academic of Sciences USA, 85:2444-2448.
11. T. Smith and M. Waterman. Identification of common molecular subsequences. Journal of Molecular Biology, 147:195-197, 1981.
12. G. Sutton, O. White, M. Adams, and A. Kerlavage. TIGR assembler: A new tool for asembling large shotgun sequencing projects. Genome Science and Technology, 1:9-19, 1995.
13. R. Tarjan. Efficiency of a good but not linear set union algorithm. Journal of the ACM, 22(2):215-225, 1975.
14. E. Ukkonen. On-line construction of suffix trees. Algorithmica, 14:249-260, 1995.
15. P. Weiner. Linear pattern matching algorithm. In Proc. 14th IEEE Symposium on Switching and Automata Theory, pages 1-11, 1973.