This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
4.8 Bibliographic Notes
M. I. Abouelhoda, S. Kurtz, and E. Ohlebusch: Replacing suffix arrays with enhanced suffix arrays. Journal of Discrete Algorithms 2, 2004, pp. 53–86.
A. V. Aho, J. E. Hopcroft, and J. D. Ullman: The Design and Analysis of Computer Algorithms. Addison-Wesley, 1974.
A. Apostolico: The myriad virtues of subword trees. In: A. Apostolico, and Z. Galil (eds.): Combinatorics on Words. Springer, NATO ASI series vol. 112, 1985, pp. 85–96.
A. Apostolico and R. Giancarlo: The Boyer-Moore-Galil string searching strategies revisited. SIAM Journal on Computing 15, 1986, pp. 98–105.
R. S. Boyer and J. S. Moore: A fast string-searching algorithm. Communications of the ACM 20(10), 1977, pp. 762–772.
T. H. Cormen, C. E. Leiserson, and R. L. Rivest: Introduction to Algorithms. McGraw-Hill, 1990.
T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein: Introduction to Algorithms, 2nd edition. McGraw-Hill, 2001.
M. Crochemore and W. Rytter: Text Algorithms. Oxford University Press, 1994.
D. Gusfield: Algorithms on Strings, Trees, and Sequences. Cambridge University Press, 1997.
J. E. Hopcroft, R. Motwani, and J D. Ullman: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley 2001, 2nd edition.
J. Hromkoviç: Theoretical Computer Science. Springer, 2004.
J. Hromkoviç: Algorithmics for Hard Problems, 2nd edition. Springer, 2003.
J. Kärkkäinen and P. Sanders: Simple linear work suffix array construction. Proceedings of the 30th International Colloquium on Automata, Languages and Programming (ICALP’03), Springer LNCS 2719, 2003, pp. 943–955.
D. E. Knuth, J. H. Morris, and V. R. Pratt: Fast pattern matching in strings. SIAM Journal on Computing 6(2), 1977, pp. 323–350.
U. Manber and E. W. Myers: Suffix arrays: a new method for on-line string searches. SIAM Journal on Computing 22(5), 1993, pp. 935–948.
E. M. McCreight: A space-economical suffix tree construction algorithm. Journal of the ACM 23, 1976, pp. 262–272.
W. Rytter: A correct preprocessing algorithm for Boyer-Moore string searching. SIAM Journal on Computing 9, 1980, pp. 509–512.
E. Ukkonen: On-line construction of suffix-trees. Algorithmica 14, 1995, pp. 249–260.
P. Weiner: Linear pattern matching algorithms. Proceedings of the 14th IEEE Symposium on Switching and Automata Theory, 1973, pp. 1–11.
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2007). String Algorithms. In: Algorithmic Aspects of Bioinformatics. Natural Computing Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71913-7_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-71913-7_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71912-0
Online ISBN: 978-3-540-71913-7
eBook Packages: Computer ScienceComputer Science (R0)