| 摘要 |
The amino acid sequence is deduced by using de novo sequencing, to prevent the correct amino acid sequence from not being ranked high as candidates. Amino acid sequence candidates are computed by finding the longest path by a branch and using a bound method based on the spectrum data on the target peptide and the known amino acid sequence. A tree-structured directed graph is used where amino acid sequences are set as nodes and the peak intensities corresponding to the amino acids are set as branches. In a sequence put at a node in the highest layer, an amino acid is placed at a terminal, and as the layer goes deeper, amino acids are sequentially placed from both terminals toward the center of the sequence. The final score is estimated based on the remaining amino acids, and if the score is small, the search is halted.
|
