Simplified validation of borderline hits of database searches | Zendy

Thomas Henrik | Zendy; Shevchenko Andrej | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Premium

Simplified validation of borderline hits of database searches

Author(s) -

Thomas Henrik,

Shevchenko Andrej

Publication year - 2008

Publication title -

proteomics

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 1.26

H-Index - 167

eISSN - 1615-9861

pISSN - 1615-9853

DOI - 10.1002/pmic.200800250

Subject(s) - matching (statistics) , computer science , software , database , database search engine , data mining , information retrieval , search engine , mathematics , statistics , programming language

Along with unequivocal hits produced by matching multiple MS/MS spectra to database sequences, LC‐MS/MS analysis often yields a large number of hits of borderline statistical confidence. To simplify their validation, we propose to use rapid de novo interpretation of all acquired MS/MS spectra and, with the help of a simple software tool, display the candidate sequences together with each database search hit. We demonstrate that comparing hit database sequences and independent de novo interpretations of the same MS/MS spectra assists in rapid examination of ambiguous matches.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here

Accelerating Research