The MIHT is an efficient sequential IP lookup algorithm that has been shown to attain better performance than well-known tree/trie-based algorithms commonly used for IP lookup: the Binary Trie, the Prefix Tree, the Priority Trie, the DTBM, the 4-MPT and the 4-PCMST [3].
These results suggest that sequential targeted gene disruptions of independently working downregulatory genes may be an efficient and rational strategy for Streptomyces strain improvement.
This implies that sequential genetic manipulation of target genes identified through interspecies comparative microarray analysis may be an efficient and rational strategy for Streptomyces strain improvement [ 10, 37].
The solution to the large system of algebraic equations resulting from the finite element discretisation and linearisation of the set of coupled partial differential equations to be solved is obtained by means of an efficient (sequential or massively parallel) direct solver.
PrefixSpan [ 21] is an efficient algorithm for sequential pattern mining.
Parallel updates are not guaranteed to converge, however, and we develop an efficient sequential approach in Section 5 that does not suffer from this problem.
Results show that IMSR_PreTree outperforms MSR_PreTree and IMSR_PreTree is an efficient and scalable approach for mining sequential patterns in large databases.
An efficient sequential method was developed to estimate the unknown boundary condition on the surface of a body from transient temperature measurements inside the solid [2].
Furthermore, we performed a trial sequential analysis; this is an efficient decision-making tool that is used to establish whether firm evidence of effect has been obtained [ 70].
