Then based on partial suffix tree, presents a new parallel algorithm of suffix tree, which can construction large suffix tree in memory and more perfect to very large sequences.
在部分后缀树的基础上提出了后缀树的并行算法，解决了后缀树在应用上的内存瓶颈问题，因此更适合大规模的序列分析。
Then based on partial suffix tree, presents a new parallel algorithm of suffix tree, which can construction large suffix tree in memory and more perfect to very large sequences.
在部分后缀树的基础上提出了后缀树的并行算法，解决了后缀树在应用上的内存瓶颈问题，因此更适合大规模的序列分析。
应用推荐