{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,26]],"date-time":"2023-01-26T05:20:49Z","timestamp":1674710449805},"reference-count":5,"publisher":"Oxford University Press (OUP)","issue":"16","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,8,15]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Contact: \u00a0zyhe@dlut.edu.cn<\/jats:p>","DOI":"10.1093\/bioinformatics\/bts346","type":"journal-article","created":{"date-parts":[[2012,6,27]],"date-time":"2012-06-27T07:43:59Z","timestamp":1340783039000},"page":"2211-2212","source":"Crossref","is-referenced-by-count":1,"title":["Comments on \u2018MMFPh: A Maximal Motif Finder for Phosphoproteomics Datasets\u2019"],"prefix":"10.1093","volume":"28","author":[{"given":"Zengyou","family":"He","sequence":"first","affiliation":[{"name":"School of Software, Dalian University of Technology, Dalian 116620, China."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haipeng","family":"Gong","sequence":"additional","affiliation":[{"name":"School of Software, Dalian University of Technology, Dalian 116620, China."}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2012,6,25]]},"reference":[{"key":"2023012512560297000_B1","first-page":"487","article-title":"Fast algorithms for mining association rules","author":"Agrawal","year":"1994","journal-title":"Proceedings of VLDB'94"},{"key":"2023012512560297000_B2","doi-asserted-by":"crossref","first-page":"61","DOI":"10.4310\/SII.2012.v5.n1.a6","article-title":"Permutation methods for testing the significance of phosphorylation motifs","volume":"5","author":"Gong","year":"2012","journal-title":"Statistics and Its Interface"},{"key":"2023012512560297000_B3","doi-asserted-by":"crossref","first-page":"S22","DOI":"10.1186\/1471-2105-12-S1-S22","article-title":"Motif-All: discovering all phosphorylation motifs","volume":"12","author":"He","year":"2011","journal-title":"BMC Bioinformatics"},{"key":"2023012512560297000_B4","doi-asserted-by":"crossref","first-page":"1391","DOI":"10.1038\/nbt1146","article-title":"An iterative statistical approach to the identification of protein phosphorylation motifs from large-scale data sets","volume":"23","author":"Schwartz","year":"2005","journal-title":"Nat. Biotechnol."},{"key":"2023012512560297000_B5","doi-asserted-by":"crossref","first-page":"1562","DOI":"10.1093\/bioinformatics\/bts195","article-title":"MMFPh: a maximal motif finder for phospho-proteomics datasets","volume":"28","author":"Wang","year":"2012","journal-title":"Bioinformatics"}],"container-title":["Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/28\/16\/2211\/48871755\/bioinformatics_28_16_2211.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/28\/16\/2211\/48871755\/bioinformatics_28_16_2211.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,25]],"date-time":"2023-01-25T18:13:02Z","timestamp":1674670382000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article\/28\/16\/2211\/324620"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6,25]]},"references-count":5,"journal-issue":{"issue":"16","published-print":{"date-parts":[[2012,8,15]]}},"URL":"https:\/\/doi.org\/10.1093\/bioinformatics\/bts346","relation":{},"ISSN":["1367-4811","1367-4803"],"issn-type":[{"value":"1367-4811","type":"electronic"},{"value":"1367-4803","type":"print"}],"subject":[],"published-other":{"date-parts":[[2012,8,15]]},"published":{"date-parts":[[2012,6,25]]}}}