Distributed and paged suffix trees for large genetic databases

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

Volumn 2676, Issue , 2003, Pages 70-82

  Clifford, Raphaël ^a   Sergot, Marek ^a  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; FORESTRY; PATTERN MATCHING;

BEOWULF CLUSTER; DISTRIBUTED MEMORY; GENOME SEQUENCES; INTERPROCESS COMMUNICATION; LINEAR TIME CONSTRUCTION; MEMORY BOTTLENECK; PARALLEL-COMPUTING ENVIRONMENT; SINGLE PROCESSORS;

TREES (MATHEMATICS);

EID: 35248834611     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44888-8_6     Document Type: Article

References (19)

1. A. Andersson, N. Larsson, Jesper, and K. Swanson. Suffix trees on words. In Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching, LNCS 1075, pages 102-115. Springer-Verlag, 1996.
2. A. Andersson and S. Nilsson. Improved behaviour of tries by adaptive branching. Information Processing Letters, 46:293-300, 1993.
3. A. Apostolico. The myriad virtues of subword trees. In A. Apostolico and Z. Galil, editors, Combinatorial Algorithms on Words, volume F12 of NATO ASI Series, pages 85-96. Springer-Verlag, 1985.
4. W. I. Chang and E. L. Lawler. Sublinear expected time approximate string matching and biological applications. Algorithmica, 12:327-344, 1994.
5. R. Clifford. Indexed strings for large-scale genomic analysis. PhD thesis, Imperial College of Science Technology and Medicine, London, April 2001.
6. A. Delcher, S. Kasif, R. Fleischmann, J. Peterson, O. White, and S. Salzberg. Alignment of whole genomes. Nucleic Acids Research, 27(11):2369-2376, 1999.
7. B. Dorohonceanu and C. Nevill-Manning. Accelerating protein classification using suffix trees. In Proceedings of the 8th International Conference on Intelligent Systems for Molecular Biology (ISMB), pages 126-133, 2000.
8. P. Ferragina and R. Grossi. A fully-dynamic data structure for external substring search. In Proceedings of the 27th Annual ACM Symposium on Theory of Computing, pages 693-702, Las Vegas, Nevada, 1995.
9. P. Ferragina and R. Grossi. Fast string searching in secondary storage: Theoretical developments and experimental results. In Proceedings of the Seventh Annual Symposium on Discrete Algorithms, pages 373-382, Atlanta, Georgia, 1996.
10. P. Ferragina and R. Grossi. The string B-Tree: a new data structure for string search in external memory and its applications. Journal of the ACM, 46(2):238-280, 1999.
11. R. Giegerich and S. Kurtz. From Ukkonen to McCreight and Weiner: A unifying view of linear-time suffix tree construction. Algorithmica, 1997.
12. D. Gusfield. Algorithms on strings, trees and sequences. Computer Science and Computational Biology. Cambridge University Press, 1997.
13. D. Gusfield, G. M. Landau, and D. Schieber. An efficient algorithm for the all pairs suffix-prefix problem. Information Processing Letters, 41:181-185, 1992.
14. J. Kärkkäinen. Suffix cactus : a cross between suffix tree and suffix array. In Z. Galil and E. Ukkonen, editors, Proceedings of the 6th Annual Symposium on Combinatorial Pattern Matching, LNCS 937, pages 191-204. Springer-Verlag, 1995.
15. J. Kärkkäinen and E. Ukkonen. Sparse suffix trees. In COCOON '96, Hong Kong, LNCS 1090, pages 219-230. Springer-Verlag, 1996.
16. S. Kurtz. Reducing the space requirement of suffix trees. Report 98-03. Technical report, Technische Fakultat, Universität Bielefeld, 1998.
17. S. Kurtz and C. Schleiermacher. Reputer: Fast computation of maximal repeats in complete genomes. Bioinformatics, 15(5):426-427, 1999.
18. U. Manber and G. Myers. Suffix arrays: a new method for on-line string searches. In Proceedings of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms, 1990.
19. E. Ukkonen. On-line construction of suffix-trees. Algorithmica, 14:249-260, 1995.