PTMTreeSearch: a novel two-stage tree-search algorithm with pruning rules for the identification of post-translational modification of proteins in MS/MS spectra | Zendy

Attila KertészFarkas | Zendy; Beáta Reiz | Zendy; Roberto Vera Alvarez | Zendy; Michael P. Myers | Zendy; Sándor Pongor | Zendy

Open Access

PTMTreeSearch: a novel two-stage tree-search algorithm with pruning rules for the identification of post-translational modification of proteins in MS/MS spectra

Author(s) -

Attila KertészFarkas,

Beáta Reiz,

Roberto Vera Alvarez,

Michael P. Myers,

Sándor Pongor

Publication year - 2013

Publication title -

bioinformatics

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 3.599

H-Index - 390

eISSN - 1367-4811

pISSN - 1367-4803

DOI - 10.1093/bioinformatics/btt642

Subject(s) - pruning , computer science , identification (biology) , sequence database , set (abstract data type) , tree (set theory) , database search engine , algorithm , posttranslational modification , tandem mass spectrometry , sequence (biology) , search tree , construct (python library) , data mining , search algorithm , search engine , information retrieval , mass spectrometry , mathematics , biology , programming language , chemistry , mathematical analysis , biochemistry , botany , enzyme , genetics , chromatography , agronomy , gene

Tandem mass spectrometry has become a standard tool for identifying post-translational modifications (PTMs) of proteins. Algorithmic searches for PTMs from tandem mass spectrum data (MS/MS) tend to be hampered by noisy data as well as by a combinatorial explosion of search space. This leads to high uncertainty and long search-execution times.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research