Volume 410; Issue 51

Theoretical Computer Science

Volume 410; Issue 51
1

Foreword

Paolo Ferragina, Gad M. Landau
Journal:
Theoretical Computer Science
Year:
2009
Language:
english
File:
PDF, 138 KB
english, 2009
4

Faster entropy-bounded compressed suffix trees

Johannes Fischer, Veli Mäkinen, Gonzalo Navarro
Journal:
Theoretical Computer Science
Year:
2009
Language:
english
File:
PDF, 807 KB
english, 2009
5

Why greed works for shortest common superstring problem

Bin Ma
Journal:
Theoretical Computer Science
Year:
2009
Language:
english
File:
PDF, 504 KB
english, 2009
6

Approximate string matching with address bit errors

Amihood Amir, Yonatan Aumann, Oren Kapah, Avivit Levy, Ely Porat
Journal:
Theoretical Computer Science
Year:
2009
Language:
english
File:
PDF, 721 KB
english, 2009
7

On the longest common parameterized subsequence

Orgad Keller, Tsvi Kopelowitz, Moshe Lewenstein
Journal:
Theoretical Computer Science
Year:
2009
Language:
english
File:
PDF, 484 KB
english, 2009
8

Searching for gapped palindromes

Roman Kolpakov, Gregory Kucherov
Journal:
Theoretical Computer Science
Year:
2009
Language:
english
File:
PDF, 700 KB
english, 2009