In this paper we propose a new algorithm for the de novo peptide sequencing problem. This problem reconstructs a peptide sequence from a given tandem mass spectra data containing n peaks. We first build a directed acyclic graph G=(V, E) in O(n log n) time, where v in V such that v is a spectrum mass ion or that with complementary mass. The solutions of this problem are then given by the paths in the graph between two designated vertices. Unlike previous approaches, the proposed algorithm does not use dynamic programming, and is built in a progressive fashion using a priority queue, thus obtaining an improvement over other methods.

Brunetti, S., Dutta, D., Liberatori, S., Mori, E., & Varrazzo, D. (2005). An efficient algorithm for de novo peptide sequencing. In Adaptive and Natural Computing Algorithms (pp.312-315).

An efficient algorithm for de novo peptide sequencing

BRUNETTI, SARA;
2005

Abstract

In this paper we propose a new algorithm for the de novo peptide sequencing problem. This problem reconstructs a peptide sequence from a given tandem mass spectra data containing n peaks. We first build a directed acyclic graph G=(V, E) in O(n log n) time, where v in V such that v is a spectrum mass ion or that with complementary mass. The solutions of this problem are then given by the paths in the graph between two designated vertices. Unlike previous approaches, the proposed algorithm does not use dynamic programming, and is built in a progressive fashion using a priority queue, thus obtaining an improvement over other methods.
Brunetti, S., Dutta, D., Liberatori, S., Mori, E., & Varrazzo, D. (2005). An efficient algorithm for de novo peptide sequencing. In Adaptive and Natural Computing Algorithms (pp.312-315).
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/11365/26694
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo