A modification of the landau-vishkin algorithm computing longest common extensions via suffix arrays

Authors:
Rodrigo de Castro Miranda;Mauricio Ayala-Rincón
Affiliations:
Programa de Mestrado em Informática;Programa de Mestrado em Informática
Venue:
BSB'05 Proceedings of the 2005 Brazilian conference on Advances in Bioinformatics and Computational Biology
Year:
2005

Citing 7
Cited 1

Introducing efficient parallelism into approximate string matching and a new serial algorithm

STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Suffix arrays: a new method for on-line string searches

SIAM Journal on Computing
Algorithms on strings, trees, and sequences: computer science and computational biology

Algorithms on strings, trees, and sequences: computer science and computational biology
Reducing the space requirement of suffix trees

Software—Practice & Experience
The LCA Problem Revisited

LATIN '00 Proceedings of the 4th Latin American Symposium on Theoretical Informatics
Scaling and related techniques for geometry problems

STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Simple linear work suffix array construction

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming

Practical Algorithms for the Longest Common Extension Problem

SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval

Quantified Score

Hi-index	0.00

Visualization

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.