Inproceedings,

The Efficient Computation of Complete and Concise Substring Scales with Suffix Trees.

.
ICFCA, volume 4390 of Lecture Notes in Computer Science, page 98-113. Springer, (2007)

Meta data

Tags

Users

  • @sebferre
  • @dblp
  • @sdo

Comments and Reviews