Lanean...

FACC: A Novel Finite Automaton Based on Cloud Computing for the Multiple Longest Common Subsequences Search

Searching for the multiple longest common subsequences (MLCS) has significant applications in the areas of bioinformatics, information processing, and data mining, and so forth, Although a few parallel MLCS algorithms have been proposed, the efficiency and effectiveness of the algorithms are not sat...

Deskribapen osoa

Gorde:
Xehetasun bibliografikoak
Egile Nagusiak: Yanni Li, Yuping Wang, Liang Bao
Formatua: Artigo
Hizkuntza:Inglês
Argitaratua: Hindawi Limited 2012-01-01
Saila:Mathematical Problems in Engineering
Sarrera elektronikoa:http://dx.doi.org/10.1155/2012/310328
Etiketak: Etiketa erantsi
Etiketarik gabe, Izan zaitez lehena erregistro honi etiketa jartzen!