Solving NP Hard Problems in the Framework of Gene Assembly in Ciliates
| Autor: | Khuder Altangerel, Ganbat Ganbaatar, Tseren-Onolt Ishdorj |
|---|---|
| Rok vydání: | 2018 |
| Předmět: |
Computer science
Parallel algorithm 020206 networking & telecommunications 0102 computer and information sciences 02 engineering and technology Parallel computing Decision problem Solver 01 natural sciences Field (computer science) Gene assembly 010201 computation theory & mathematics 0202 electrical engineering electronic engineering information engineering Parallel complexity |
| Zdroj: | Communications in Computer and Information Science ISBN: 9789811328251 BIC-TA (1) |
| DOI: | 10.1007/978-981-13-2826-8_10 |
| Popis: | Molecular computing [1] is a field with a great potential and fastest growing area of Computer Science. Although some approaches to solve NP hard problems were successfully accomplished on DNA strand, only few results of practical use so far. A direction of molecular computing namely Gene assembly in ciliates has been studied actively [3] for a decade. In the present paper, we use a variant of gene assembly computing model of Guided recombination system with only two operations of insertion and deletion [7] as a decision problem solver. We present our results of parallel algorithms which solve computational hard problems HPP and CSP, in an efficient time. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|