Fully compressed suffix trees

Published 2011 View Full Article

  1. Home
  2. Publications
  3. Publication Search
  4. Publication Details
Title
Fully compressed suffix trees
Authors
Keywords
-
Journal
ACM Transactions on Algorithms
Volume 7, Issue 4, Pages 1-34
Publisher
Association for Computing Machinery (ACM)
Online
2011-09-27
DOI
10.1145/2000807.2000821

Ask authors/readers for more resources

Protocol

Community support

Reagent

Community support

Reprint

Contact the author

Create your own webinar

Interested in hosting your own webinar? Check the schedule and propose your idea to the Peeref Content Team.

Create Now

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
Webinars Posters Questions Hubs Funding Journals Articles Connect Collections Reviewers About Us FAQs Mobile App Privacy Policy Terms of Use
© Peeref 2019-2024. All rights reserved.