David R. Swanson

Prof. David R. Swanson


Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
26 January 2011 in BMC Research Notes
Verified
Journal Article
Open access
PDF file
Robert PowersRobert Powers
Robert Powers
JCJennifer C Copeland
Jennifer C Copeland
JSJaime L Stark
Jaime L Stark
ACAdam Caprez
Adam Caprez
AGAshu Guru
Ashu Guru
DSDavid R. Swanson
David R. Swanson
A recent analysis of protein sequences deposited in the NCBI RefSeq database indicates that ~8.5 million protein sequences are encoded in prokaryotic and eukaryotic genomes, where ~30% are explicitly annotated as "hypothetical" or "uncharacterized" protein. Our C omparison of P rotein A ctive-S ite S tructures (CPASS v.2) database and software compares the sequence and structural characteristics of experimentally determined ligand binding sites to infer a functional relationship in the absence of global sequence or structure similarity. CPASS is an important component of our F unctional A nnotation S creening T echnology by NMR (FAST-NMR) protocol and has been successfully applied to aid the annotation of a number of proteins of unknown function. We report a major upgrade to our CPASS software and database that significantly improves its broad utility. CPASS v.2 is designed with a layered architecture to increase flexibility and portability that also enables job distribution over the Open Science Grid (OSG) to increase speed. Similarly, the CPASS interface was enhanced to provide more user flexibility in submitting a CPASS query. CPASS v.2 now allows for both automatic and manual definition of ligand-binding sites and permits pair-wise, one versus all, one versus list, or list versus list comparisons. Solvent accessible surface area, ligand root-mean square difference, and Cβ distances have been incorporated into the CPASS similarity function to improve the quality of the results. The CPASS database has also been updated. CPASS v.2 is more than an order of magnitude faster than the original implementation, and allows for multiple simultaneous job submissions. Similarly, the CPASS database of ligand-defined binding sites has increased in size by ~ 38%, dramatically increasing the likelihood of a positive search result. The modification to the CPASS similarity function is effective in reducing CPASS similarity scores for false positives by ~30%, while leaving true positives unaffected. Importantly, receiver operating characteristics (ROC) curves demonstrate the high correlation between CPASS similarity scores and an accurate functional assignment. As indicated by distribution curves, scores ≥ 30% infer a functional similarity. Software URL: http://cpass.unl.edu .

1 July 2006 in Cluster Computing
Verified
Journal Article
Closed access
PDF file
XQXiao Qin
Xiao Qin
HJHong Jiang
Hong Jiang
YZYifeng Zhu
Yifeng Zhu
DSDavid R. Swanson
David R. Swanson

1 December 2006 in The Journal of Supercomputing
Verified
Journal Article
Closed access
PDF file
NMNader Mohamed
Nader Mohamed
JAJameela Al-Jaroodi
Jameela Al-Jaroodi
HJHong Jiang
Hong Jiang
DSDavid R. Swanson
David R. Swanson

1 October 2006 in Cluster Computing
Verified
Journal Article
Closed access
PDF file
YZYifeng Zhu
Yifeng Zhu
HJHong Jiang
Hong Jiang
XQXiao Qin
Xiao Qin
DFDan Feng
Dan Feng
DSDavid R. Swanson
David R. Swanson


13 April 2020 in arXiv
Verified
Preprint
Open access
PDF file
ZZZhe Zhang
Zhe Zhang
BBBrian Bockelman
Brian Bockelman
DWDerek Weitzel
Derek Weitzel
XZXinkai Zhang
Xinkai Zhang
HVHamid Vakilzadian
Hamid Vakilzadian
DSDavid R. Swanson
David R. Swanson
Failure is inevitable in scientific computing. As scientific applications and facilities increase their scales over the last decades, finding the root cause of a failure can be very complex or at times nearly impossible. Different scientific computing customers have varying availability demands as well as a diverse willingness to pay for availability. In contrast to existing solutions that try to provide higher and higher availability in scientific grids, we propose a model called Task Replication for User-defined Availability (Trua). Trua provides flexible, user-defined, availability in scientific grids, allowing customers to express their desire for availability to computational providers. Trua differs from existing task replication approaches in two folds. First, it relies on the historic failure information collected from the virtual layer of the scientific grids. The reliability model for the failures can be represented with a bimodal Johnson distribution which is different from any existing distributions. Second, it adopts an anomaly detector to filter out anomalous failures; it additionally adopts novel selection algorithms to mitigate the effects of temporary and spatial correlations of the failures without knowing the root cause of the failures. We apply the Trua on real-world traces collected from the Open Science Grid (OSG). Our results show that the Trua can successfully meet user-defined availability demands.