ロード中...
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...
保存先:
| 主要な著者: | , , |
|---|---|
| フォーマット: | Artigo |
| 言語: | Inglês |
| 出版事項: |
Hindawi Limited
2012-01-01
|
| シリーズ: | Mathematical Problems in Engineering |
| オンライン･アクセス: | http://dx.doi.org/10.1155/2012/310328 |
| タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|