We investigate a problem from computational biology: Given a constant-size alphabet with a weight function on the characters, find an efficient data structure and query algorithm for solving the problem of finding substring with a given query weight. We investigate different variants of the problem and present several efficient algorithms.
Algorithmic Complexity of Protein Identification: Searching in Weighted Strings.
Liptak, Zsuzsanna;
2002-01-01
Abstract
We investigate a problem from computational biology: Given a constant-size alphabet with a weight function on the characters, find an efficient data structure and query algorithm for solving the problem of finding substring with a given query weight. We investigate different variants of the problem and present several efficient algorithms.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
TCS_2002.pdf
solo utenti autorizzati
Tipologia:
Versione dell'editore
Licenza:
Copyright dell'editore
Dimensione
267.52 kB
Formato
Adobe PDF
|
267.52 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.
