18th International Parallel and Distributed Processing Symposium, 2004. Proceedings.
DOI: 10.1109/ipdps.2004.1303208
|View full text |Cite
|
Sign up to set email alerts
|

Constrained De Novo peptide identification via multi-objective optimization

Abstract: Abstract

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
11
0

Publication Types

Select...
4
1
1

Relationship

1
5

Authors

Journals

citations
Cited by 9 publications
(11 citation statements)
references
References 32 publications
0
11
0
Order By: Relevance
“…The work presented at HiCOMB'04 [7] showed how constrained peptide identification can be formulated as a multi-objective optimization and how structured population can significantly reduce the overheads of maintaining large populations, including Pareto ranking with its quadratic worstcase time complexity. This paper extends the above work by showing one way to effectively restore the selection pressure that is lost by a purely Pareto-rank based formulation.…”
Section: Peptide Identificationmentioning
confidence: 99%
“…The work presented at HiCOMB'04 [7] showed how constrained peptide identification can be formulated as a multi-objective optimization and how structured population can significantly reduce the overheads of maintaining large populations, including Pareto ranking with its quadratic worstcase time complexity. This paper extends the above work by showing one way to effectively restore the selection pressure that is lost by a purely Pareto-rank based formulation.…”
Section: Peptide Identificationmentioning
confidence: 99%
“…29,30 Another technique attacks the peptide identification problem by stochastic optimization using genetic algorithms to solve multiobjective models and can empirically test for independence between scoring functions. [31][32][33] The algorithm NovoHMM 34 uses a hidden Markov model to solve the peptide sequencing problem, where the observable random variables are the observed mass peaks and the hidden variables correspond to the unknown peptide sequence. Despite the vast potential of de novo methods, they are often computationally expensive and exhibit variable prediction accuracies.…”
Section: Introductionmentioning
confidence: 99%
“…234,[236][237][238] Another class of methods which are stochastic and use genetic algorithms were recently proposed. 239,240 The methods in (b) employ a graph theoretical framework coupled with a penalty/reward function which is correlated by empirical observations and/or heuristic methods. 235,[241][242][243][244][245] An alternative technique to the graph-based approaches postulates hypothetical spectra and uses an empirical best-fit objective which tries to match the experimental spectra.…”
mentioning
confidence: 99%