Faster entropy-bounded compressed suffix trees

Title
Faster entropy-bounded compressed suffix trees
Authors
Keywords
-
Journal
THEORETICAL COMPUTER SCIENCE
Volume 410, Issue 51, Pages 5354-5364
Publisher
Elsevier BV
Online
2009-09-16
DOI
10.1016/j.tcs.2009.09.012

Ask authors/readers for more resources

Publish scientific posters with Peeref

Peeref publishes scientific posters from all research disciplines. Our Diamond Open Access policy means free access to content and no publication fees for authors.

Learn More

Become a Peeref-certified reviewer

The Peeref Institute provides free reviewer training that teaches the core competencies of the academic peer review process.

Get Started