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

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.
9781402071812
weighted strings, database search, protein identification, string combinatorics
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11562/391097
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? 0
social impact