python中的后缀树实现 [英] suffix tree implementation in python

问题描述

想知道您是否知道python中任何基于C的扩展都可以帮助我在线性时间内构造后缀树/数组吗?

Just wondering if you are aware of any C based extension in python that can help me construct suffix trees/arrays in linear time ?

推荐答案

您可以签出以下实现.

You can checkout the following implementations.

http://www.daimi.au.dk/~mailund/suffix_tree. html

https://hkn.eecs.berkeley.edu/~dyoo/python/suffix_trees/

https://github.com/kvh/Python-Suffix-Tree

一个人改进了(第一个)并将其放在这里.

A guy improved (first one) and put it here.

http://researchonsearch.blogspot.com/2010/05/suffix-tree-implementation-with-unicode.html

所有都是C实现.

这篇关于python中的后缀树实现的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！