Sparse and Truncated Suffix Trees on Variable-Length Codes

@inproceedings{Uemura2011SparseAT,
  title={Sparse and Truncated Suffix Trees on Variable-Length Codes},
  author={Takashi Uemura and Hiroki Arimura},
  booktitle={CPM},
  year={2011}
}
The sparse suffix trees (SST), introduced by (Kärkkäinen and Ukkonen, COCOON 1996), is the suffix tree for a subset of all suffixes of an input text T of length n. In this paper, we study a special case that an input string is a sequence of codewords drawn from a regular prefix code ∆ ⊆ Σ recognized by a finite automaton, and index points locate on the code boundaries. In this case, we present an online algorithm that constructs the sparse suffix tree for an input string t on any variable… CONTINUE READING
6 Citations
13 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 13 references

A linear-time off-line construction of property suffix trees

  • T. Uemura, H. Arimura
  • IEICE Trans. Inf. & Syst., J91-D(3),
  • 2008
1 Excerpt

Property machting and weighted matching

  • E. Chencinski A. Amir, C. Iliopoulos, T. Kopelowitz, H. Zhang
  • Proc . CPM ’ 06 , LNCS
  • 2006

Ukkonen , Sparse suffix trees

  • J. Kärkkäinen, E.
  • Proc . COCOON ’ 96 , LNCS , Springer
  • 2006

Similar Papers

Loading similar papers…