Lataa...

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...

Täydet tiedot

Tallennettuna:
Bibliografiset tiedot
Päätekijät: Yanni Li, Yuping Wang, Liang Bao
Aineistotyyppi: Artigo
Kieli:Inglês
Julkaistu: Hindawi Limited 2012-01-01
Sarja:Mathematical Problems in Engineering
Linkit:http://dx.doi.org/10.1155/2012/310328
Tagit: Lisää tagi
Ei tageja, Lisää ensimmäinen tagi!