Abstract
Landau and Vishkin developed an O(kn) algorithm for the approximate string matching problem, where k is the maximum number of admissible errors and n the length of the text. This algorithm uses suffix trees for an O(1) running time computation of the longest common extensions between strings. We present a variation of this algorithm which uses suffix arrays for computing the longest common extensions.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bender, M., Farach-Colton, M.: The LCA Problem Revisited. In: Gonnet, G.H., Viola, A. (eds.) LATIN 2000. LNCS, vol. 1776, pp. 88–94. Springer, Heidelberg (2000)
Gabow, H.N., Bentley, J.L., Tarjan, R.E.: Scaling and related techniques for geometry problems. In: 16th ACM STOC, pp. 135–143 (1984)
Gusfield, D.: Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. Cambridge University Press, Cambridge (1997)
Kärkkäinen, J., Sanders, P.: Simpler linear work suffix array construction. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 943–955. Springer, Heidelberg (2003)
Ko, P., Aluru, S.: Space-Efficient Linear Time Construction of Suffix Arrays. Journal of Discrete Algorithms (to appear)
Kurtz, S.: Reducing the space requirement of suffix trees. Softw., Pract. Exper. 29(13), 1149–1171 (1999)
Landau, G., Vishkin, U.: Introducing Efficient Parallelism into Approximate String Matching and a new Serial Algorithm. In: 18th ACM STOC, pp. 220–230 (1986)
Manber, U., Myers, G.: Suffix arrays: A new method for on-line string searches. TR 89-14, University of Arizona (1989); SIAM J. Comput. 22(5), 935–948 (1993)
Ukkonen, E.: On-line Construction of Suffix-Trees. Algorithmica 14, 249–260 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
de Castro Miranda, R., Ayala-Rincón, M. (2005). A Modification of the Landau-Vishkin Algorithm Computing Longest Common Extensions via Suffix Arrays. In: Setubal, J.C., Verjovski-Almeida, S. (eds) Advances in Bioinformatics and Computational Biology. BSB 2005. Lecture Notes in Computer Science(), vol 3594. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11532323_25
Download citation
DOI: https://doi.org/10.1007/11532323_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28008-8
Online ISBN: 978-3-540-31861-3
eBook Packages: Computer ScienceComputer Science (R0)