Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Archie L. Cobbs"'
Autor:
Archie L. Cobbs
Publikováno v:
Communications of the ACM. 65:43-47
Are we doing this right?
Autor:
Archie L. Cobbs
Publikováno v:
Queue. 20:24-39
A few years ago, my team was working on a commercial Java development project for Enhanced 911 (E911) emergency call centers. We were frustrated by trying to meet the data-storage requirements of this project using the traditional model of Java over
Autor:
Harsha P. Gunawardena, Yuan-Wei Nei, Michael R. Heaven, Richard M. Caprioli, Danielle B. Gutierrez, Jeremy L. Norris, Archie L. Cobbs, Anthony W. Herren
Publikováno v:
Analytical chemistry. 90(15)
State-of-the-art strategies for proteomics are not able to rapidly interrogate complex peptide mixtures in an untargeted manner with sensitive peptide and protein identification rates. We describe a data-independent acquisition (DIA) approach, microD
Autor:
Adam J. Funk, Kenneth D. Greis, Jeremy L. Norris, Archie L. Cobbs, Michael R. Heaven, Robert E. McCullumsmith, Wendy D. Haffey
Publikováno v:
Journal of Mass Spectrometry. 51:1-11
Data-independent acquisition (DIA)-based proteomics has become increasingly complicated in recent years because of the vast number of workflows described, coupled with a lack of studies indicating a rational framework for selecting effective settings
Autor:
Michael R, Heaven, Adam J, Funk, Archie L, Cobbs, Wendy D, Haffey, Jeremy L, Norris, Robert E, McCullumsmith, Kenneth D, Greis
Publikováno v:
Journal of mass spectrometry : JMS. 51(1)
Data-independent acquisition (DIA)-based proteomics has become increasingly complicated in recent years because of the vast number of workflows described, coupled with a lack of studies indicating a rational framework for selecting effective settings
Autor:
Archie L. Cobbs
Publikováno v:
Combinatorial Pattern Matching ISBN: 9783540600442
CPM
CPM
Let T be a text of length n and P a pattern of length m, both strings over a fixed finite alphabet σ. We wish to find all approximate occurrences of P in T having weighted edit distance at most k from P: this is the approximate substring matching pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::261991d9f4a4bb685b46a2707cf50410
https://doi.org/10.1007/3-540-60044-2_33
https://doi.org/10.1007/3-540-60044-2_33
Autor:
Archie L. Cobbs
Publikováno v:
Combinatorial Pattern Matching ISBN: 9783540580942
CPM
CPM
Let two strings S, T over a finite alphabet Σ be given, and let M be an arbitrary relation on Σ×Σ. Define an approximate match (x,y) of two length m subwords (substrings) x ⊑ S, y ⊑ T when M(x i ,y i , for all 1≤i≤m. A match implies all t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c4cb59b18ab1bb8d947610c5ee0f3c3e
https://doi.org/10.1007/3-540-58094-8_6
https://doi.org/10.1007/3-540-58094-8_6