---
title: "Discussion on \"A strategy for constructing a suffix tree quickly and efficiently with minimal memory usage\" | Hashnode"
description: "Discussion on \"A strategy for constructing a suffix tree quickly and efficiently with minimal memory usage\". Algorithmic challenge"
url: "https://hashnode.com/posts/a-strategy-for-constructing-a-suffix-tree-quickly-and-efficiently-with-minimal-memory-usage/6a3bb237944519127c0e945b"
---

[Feed](https://hashnode.com/feed) /

Discussion

# [A strategy for constructing a suffix tree quickly and efficiently with minimal memory usage](https://acdhirr.hashnode.dev/a-strategy-for-constructing-a-suffix-tree-quickly-and-efficiently-with-minimal-memory-usage?utm_source=hashnode&utm_medium=feed)

Algorithmic challenge

Jun 10 · 20 min read · acdhirr.hashnode.dev  
Updated Jun 25  
Read the article

-   [#algorithms](https://hashnode.com/tag/algorithms)
-   [#suffixtree](https://hashnode.com/tag/suffixtree)
-   [#computer-science](https://hashnode.com/tag/computer-science)
-   [#data-science](https://hashnode.com/tag/data-science)
-   [#scala](https://hashnode.com/tag/scala)

## Written by

[Richard P. Osseweyer](https://hashnode.com/@acdhirr)

@acdhirr · Rotterdam, Netherlands

  
[View profile](https://hashnode.com/@acdhirr)

Long time software engineer and application architect coding mainly in Java.

Loves to write about complex topics

## Responses

Comments are turned off for this post.
