可解释性
模棱两可
偏移量(计算机科学)
计算机科学
碎片(计算)
搜索算法
数据挖掘
随机搜索
蛋白质组学
算法
口译(哲学)
情报检索
人工智能
搜索引擎
钥匙(锁)
下游(制造业)
机器学习
作者
Carolina Rojas Ramírez,Fengchao Yu,Daniel A. Polasky,Alexey I. Nesvizhskii
标识
DOI:10.1021/acs.jproteome.5c00775
摘要
Conventional database search methods for proteomics struggle when tasked with identifying dozens or hundreds of modifications simultaneously. Open or error-tolerant searches can address this limitation but at the cost of increased difficulty in downstream interpretation of the results and quantification. We and others have previously described "mass offset" or multinotch searches that sit in between closed and open searches, allowing simultaneous search for hundreds of modifications with more straightforward downstream interpretation than open search. The original mass offset searches were closer to the open search, lacking the ability to restrict modifications to specific amino acids. Here, we describe a new "detailed" mass offset (DMO) search implemented in the MSFragger search engine, which allows each mass offset to have its own site restrictions and fragmentation rules. The benefits of the DMO search over existing mass offset searches are shown with three example searches of complex modification sets: nearly one hundred post-translational modifications, fast photochemical oxidation of proteins (FPOP)-derived modifications, and amino acid substitutions. The DMO search further improves the interpretability of results by reducing ambiguity in site localization, particularly when modifications have overlapping masses, and provides benefits that scale with the complexity of the search.
科研通智能强力驱动
Strongly Powered by AbleSci AI