Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Modifications of the Landau-Vishkin Algorithm Computing Longest Common Extensions via Suffix
 

Summary: Modifications of the Landau-Vishkin Algorithm
Computing Longest Common Extensions via Suffix
Arrays and Efficient RMQ computations
Rodrigo C´esar de Castro Miranda1
, Mauricio Ayala-Rinc´on1
, and Leon Solon1
Instituto de Ci^encias Exatas,Universidade de Bras´ilia
rodrigo.miranda@acm.org,ayala@mat.unb.br,leonsolon@gmail.com
Abstract. Approximate string matching is an important problem in Computer
Science. The standard solution for this problem is an O(mn) running time and
space dynamic programming algorithm for two strings of length m and n. Lan-
dau and Vishkin developed an algorithm which uses suffix trees for accelerating
the computation along the dynamic programming table and reaching space and
running time in O(nk), where n > m and k is the maximum number of ad-
missible differences. In the Landau and Vishkin algorithm suffix trees are used
for pre-processing the sequences allowing an O(1) running time computation of
the longest common extensions between substrings. We present two O(n) space
variations of the Landau and Vishkin algorithm that use range-minimum-queries
(RMQ) over the longest common prefix array of an extended suffix array instead
of suffix trees for computing the longest common extensions: one which computes

  

Source: Ayala-Rincón, Mauricio - Departamento de Matemática, Universidade de Brasília

 

Collections: Mathematics