因此更适合综合型人才作创业之用。
Therefore, it especially suits to integrated talents for business purposes.
在部分后缀树的基础上提出了后缀树的并行算法，解决了后缀树在应用上的内存瓶颈问题，因此更适合大规模的序列分析。
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.
这些只是临时对象，它们实际会在应用程序分区的最后一个进程结束时消失，因此更适合用于执行进程，而不适合执行整个应用程序。
These are only temporarily objects; they actually disintegrate when the final process of the application partition ends, and as such, are more geared to execute processes than entire applications.
应用推荐