This paper proposes a novel hybrid GA/SVM method that can predict the interactions between proteins intermediated by the protein-domain relations. Firstly, we represented a protein...
Bing Wang, Lu-Sheng Ge, Wen-You Jia, Li Liu, Fu-Ch...
A large and reliable DNA codeword library is key to the success of DNA based computing. Searching for sets of reliable DNA codewords is an NP-hard problem, which can take days on ...
Qinru Qiu, Daniel J. Burns, Prakash Mukre, Qing Wu
Dynamic programming for approximate string matching is a large family of different algorithms, which vary significantly in purpose, complexity, and hardware utilization. Many impl...
The field of Differential Evolution (DE) has demonstrated important advantages in single objective optimization. To date, no previous research has explored how the unique characte...
Resource searching in the current peer-to-peer (P2P) applications is mainly based on the keyword match. However, more and more P2P applications require an efficient semantic search...