Cargando…
Speeding up tandem mass spectrometry-based database searching by longest common prefix
BACKGROUND: Tandem mass spectrometry-based database searching has become an important technology for peptide and protein identification. One of the key challenges in database searching is the remarkable increase in computational demand, brought about by the expansion of protein databases, semi- or n...
Autores principales: | Zhou, Chen, Chi, Hao, Wang, Le-Heng, Li, You, Wu, Yan-Jie, Fu, Yan, Sun, Rui-Xiang, He, Si-Min |
---|---|
Formato: | Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2010
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3000425/ https://www.ncbi.nlm.nih.gov/pubmed/21108792 http://dx.doi.org/10.1186/1471-2105-11-577 |
Ejemplares similares
-
Mapping biological entities using the longest approximately common prefix method
por: Rudniy, Alex, et al.
Publicado: (2014) -
Efficient algorithms for Longest Common Subsequence of two bucket orders to speed up pairwise genetic map comparison
por: De Mattéo, Lisa, et al.
Publicado: (2018) -
Progressive search in tandem mass spectrometry
por: Joh, Yoonsung, et al.
Publicado: (2023) -
Evaluation of Database
Search Programs for Accurate
Detection of Neuropeptides in Tandem Mass Spectrometry Experiments
por: Akhtar, Malik N., et al.
Publicado: (2012) -
In Search of Disentanglement in Tandem Mass Spectrometry Datasets
por: Abram, Krzysztof Jan, et al.
Publicado: (2023)