Wotd - Documentation

This directory contains the documented C-code of the write only top down suffix tree construction, reported about in the following paper:

Giegerich, R. and Kurtz, S. and Stoye, J., Implementation of Lazy Suffix Trees, Proc.\ of the Third Workshop on Algorithmic Engineering (WAE99), Lecture Notes in Computer Science 1668, pages 30-42, 1999.

Here is the Bibtex entry:

@INPROCEEDINGS{GIE:KUR:STO:1999,
        author =        "Giegerich, R. and Kurtz, S. and Stoye, J.",
        title =         {{Efficient Implementation of Lazy Suffix Trees}},
        booktitle =     {{Proc.\ 
of the Third Workshop on Algorithmic Engineering (WAE99)}},
        publisher =     {Lecture Notes in Computer Science 1668},
        pages =         {{30-42}},
        keywords =      {{SUFFIXTREES}},
        year =          1999}

The directory contains the following list of files:

C-source code:

clock.c         routines for measuring running time
getAlpha.c      routines for obtaining an alphabet
searchpat.c     routines for generating pattern from the text
space.c         routines for space management
debug.c         routines for debugging 
readfile.c      routines for reading in large files via memory map
seterror.c      routines for buffering error messages
wotd.c          the implementation of the wotd algorithm (lazy and eager)

C-headers:

args.h      chardef.h   errordef.h  fopen.h      protodef.h  types.h
arraydef.h  debugdef.h  experim.h   megabytes.h  spacedef.h