Reducing the Space Requirement of Suffix Trees (1999)

by Stefan Kurtz
Venue:Software – Practice and Experience
Citations:117 - 10 self

Active Bibliography

172 Compressed full-text indexes – Gonzalo Navarro, Veli Mäkinen - 2007
2 Bidirectional construction of suffix trees – Shunsuke Inenaga - 2002
20 Fully-compressed suffix trees – Luís M. S. Russo, Gonzalo Navarro, Arlindo L. Oliveira - 2000
17 Suffix Trees and their Applications in String Algorithms – Roberto Grossi, Giuseppe F. Italiano - 1993
39 Efficient Implementation of Lazy Suffix Trees – R. Giegerich, S. Kurtz, J. Stoye - 1999
5 String Pattern Matching For A Deluge Survival Kit – Alberto Apostolico, Maxime Crochemore - 2000
12 Universal Data Compression Based on the Burrows-Wheeler Transformation: Theory and Practice – Bernhard Balkenhol, Stefan Kurtz - 2000
17 On Compact Directed Acyclic Word Graphs – Maxime Crochemore, Renaud Vérin - 1997
24 Database indexing for large DNA and protein sequence collections – Ela Hunt, Malcolm P. Atkinson, Robert W. Irving - 2002
4 Space Efficient Linear Time Computation Of The Burrows And Wheeler-Transformation – Stefan Kurtz, Bernhard Balkenhol - 1999
409 A Guided Tour to Approximate String Matching – Gonzalo Navarro - 1999
53 Succinct suffix arrays based on run-length encoding – Veli Mäkinen, Gonzalo Navarro - 2005
Approximate Text Searching – Gonzalo Navarro Badino - 1998
6 Unifying Text Search And Compression - Suffix Sorting, Block Sorting and Suffix Arrays – Kunihiko Sadakane - 2000
1 String Processing Algorithms – Shunsuke Inenaga - 2003
11 Universal Data Compression Based on the Burrows and Wheeler-Transformation: Theory and Practice – Bernhard Balkenhol, Stefan Kurtz - 1998
BODHI: A Database Engine for . . . – B. J. Srikanta - 2006
COMPRESSED INDEXING DATA STRUCTURES FOR BIOLOGICAL SEQUENCES – Do Huy Hoang - 2012
14 Alphabet-independent compressed text indexing – Djamal Belazzougui, Gonzalo Navarro - 2011