Suffix arrays: A new method for on-line string searches

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 1990, Pages 319-327

  Manber, Udi ^a   Myers, Gene ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

FORESTRY;

ALPHABET SIZE; EXPECTED TIME; NOVEL ALGORITHM; SPACE EFFICIENT; STRING SEARCH; SUBSTRING; SUFFIX ARRAYS; SUFFIX-TREES;

INDEXING (OF INFORMATION);

EID: 85028161017     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (25)

1. [Apo85] Apostolico, A., "The myriad virtues of subword trees", Combinatorial Algorithms on Words (A. Apostolico & Z. Galil, eds.), NATO ASI Series F: Computer and System Sciences, Vol. 12, Springer-Verlag (1985), 85-96.
2. [AI86] Apostolico, A., and C. Iliopoulos, "Parallel log-time construction of suffix trees", CSD TR 632, Dept. of Computer Science, Purdue University (1986).
3. [AP83] Apostolico, A. and F. P. Preparata, "Optimal off-line detection of repetitions in a string", Theoretical Computer Science 22(1983), 297-315.
4. [AP85] Apostolico, A. and F. P. Preparata, "Structural properties of the string statistics problem", Journal of Computer and System Science 31(1985), 394-411.
5. [BB86] Blumer, J. and A. Blumer, "On-line construction of a complete inverted file", UCSC-CRL-86-11, Dept. of Computer Science, University of Colorado (1986).
6. [BBE85] Blumer, J., Blumer, A., Ehrenfeucht, E., Haussler, D., Chen, M. T., and J. Seiferas, "The smallest automaton recognizing the subwords of a text", Theoretical Computer Science, (1985).
7. [Car75] Cardenas, A. F., "Analysis and performance of inverted data base structures", Comm. of the ACM 18, 5(1975), 253-263.
8. [CHM86] Clift, B., Haussler, D., McConnell, R., Schneider, T. D., and G. D. Stormo, "Sequence landscapes", Nucleic Acids Research 4, 1(1986), 141-158.
9. [EH86] Ehrenfeucht, A. and D. Haussler, "A new distance metric on strings computable in linear time", UCSC-CRL-86-27, Dept. of Computer Science, University of Colorado (1986).
10. [FWM84] Fraser, C., Wendt, A., and E. W. Myers, "Analyzing and compressing assembly code", Proceedings of the SIGPLAN Symposium on Compiler Construction (1984), 117-121.
11. [Gal85] Galil, Z., "Open problems in stringology", Combinatorial Algorithms on Words (A. Apostolico and Z. Galil, eds.), NATO ASI Series F: Computer and System Sciences, Vol. 12, Springer-Verlag (1985), 1-8.
12. [Go89] Gonnet G., Private communication.
13. [HT84] Harel, D. and R. E. Tarjan, "Fast algorithms for finding nearest common ancestors", SIAM Journal on Computing 13(1984), 338-355.
14. [KG083] Karlin S., Ghandour G., Ost F., Tavare S., and L. J. Korn, "New approaches for computer analysis of nucleic acid sequences", Proc. Natl, Acad. Sci. USA, 80, (September 1983), 5660-5664.
15. [KMR72] Karp R. M., R. E. Miller, and A. L. Rosenberg, "Rapid identification of repeated patterns in strings, trees and arrays", Fourth Annual ACM Symposium on Theory of Computing, (May 1972), pp. 125-136.
16. [LV86] Landau, G. M. and U. Vishkin, "Introducing efficient parallelism into approximate string matching", Proc. 18th ACM Symposium on Theory of Computing (1986), 220-230.
17. [McC76] McCreight, E. M., "A space-economical suffix tree construction algorithm", Journal of the ACM 23(1976), 262-272.
18. [MR80] Majster, M. E., and A. Reiser, "Efficient online construction and correction of position trees", SIAM Journal on Computing 9, 4(1980), 785-807.
19. [Mye88] Myers, E. W., "Incremental alignment algorithms and their applications", SIAM Journal on Computing, accepted for publication.
20. [ME89] Myers, E. W., and A. Ehrenfeucht, A sublinear algorithm for similarity searching, in preparation.
21. [RPE81] Rodeh, M., Pratt, V. R., and S. Even, "Linear algorithm for data compression via string matching", Journal of the ACM 28, 1(1981), 16-24.
22. [Sli80] Slisenko, A. O., "Detection of periodicities and string-matching in real time", Journal of Soviet Mathematics 22, 3(1983), 1316-1387;
23. translated from Zpiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, 105(1980), 62-173.
24. [SV88] B. Schieber and U. Vishkin, "On finding lowest common ancestors: Simplification and parallelization", SIAM Journal on Computing, 17(December 1988), pp. 1253-1262.
25. [Wei73] Weiner, P., "Linear pattern matching algorithm", Proc. 14th IEEE Symposium on Switching and Automata Theory (1973), 1-11.