Several algorithms of maximum search are investigated and evaluated in different configuration of P systems, namely using priorities, multiple nested membranes and linked transport. The proposed solutions are expected to find application in a wide range of problems. In particular, the authors are currently working on modeling an algorithm for DNA sequence alignment using P systems.
Maximum Search Using P Systems
FONTANA, Federico;FRANCO, Giuditta
2004-01-01
Abstract
Several algorithms of maximum search are investigated and evaluated in different configuration of P systems, namely using priorities, multiple nested membranes and linked transport. The proposed solutions are expected to find application in a wide range of problems. In particular, the authors are currently working on modeling an algorithm for DNA sequence alignment using P systems.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
Fontana.pdf
solo utenti autorizzati
Licenza:
Accesso ristretto
Dimensione
137.49 kB
Formato
Adobe PDF
|
137.49 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
