Amarda  Shehu

Prof. Dr. Amarda Shehu

George Mason University, Fairfax, California, USA
orcid

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
24 March 2018 in Bioinformatics
Verified
Journal Article
Open access
PDF file
DVDaniel Veltri
Daniel Veltri
UKUday Kamath
Uday Kamath
Amarda  ShehuAmarda Shehu
Amarda Shehu
Bacterial resistance to antibiotics is a growing concern. Antimicrobial peptides (AMPs), natural components of innate immunity, are popular targets for developing new drugs. Machine learning methods are now commonly adopted by wet-laboratory researchers to screen for promising candidates. In this work, we utilize deep learning to recognize antimicrobial activity. We propose a neural network model with convolutional and recurrent layers that leverage primary sequence composition. Results show that the proposed model outperforms state-of-the-art classification models on a comprehensive dataset. By utilizing the embedding weights, we also present a reduced-alphabet representation and show that reasonable AMP recognition can be maintained using nine amino acid types. Models and datasets are made freely available through the Antimicrobial Peptide Scanner vr.2 web server at www.ampscanner.com. Supplementary data are available at Bioinformatics online.

28 April 2016 in PLOS Computational Biology
Verified
Journal Article
Open access
PDF file
TMTatiana Maximova
Tatiana Maximova
RMRyan Moffatt
Ryan Moffatt
Buyong MaBuyong Ma
Buyong Ma
Ruth NussinovRuth Nussinov
Ruth Nussinov
Amarda  ShehuAmarda Shehu
Amarda Shehu
Investigation of macromolecular structure and dynamics is fundamental to understanding how macromolecules carry out their functions in the cell. Significant advances have been made toward this end in silico, with a growing number of computational methods proposed yearly to study and simulate various aspects of macromolecular structure and dynamics. This review aims to provide an overview of recent advances, focusing primarily on methods proposed for exploring the structure space of macromolecules in isolation and in assemblies for the purpose of characterizing equilibrium structure and dynamics. In addition to surveying recent applications that showcase current capabilities of computational methods, this review highlights state-of-the-art algorithmic techniques proposed to overcome challenges posed in silico by the disparate spatial and time scales accessed by dynamic macromolecules. This review is not meant to be exhaustive, as such an endeavor is impossible, but rather aims to balance breadth and depth of strategies for modeling macromolecular structure and dynamics for a broad audience of novices and experts. This paper provides an overview of recent advancements in computational methods for modeling macromolecular structure and dynamics. The focus is on methods aimed at providing efficient representations of macromolecular structure spaces for the purpose of characterizing equilibrium dynamics. The overview is meant to provide a summary of state-of-the-art capabilities of these methods from an application point of view, as well as highlight important algorithmic contributions responsible for recent advances in macromolecular structure and dynamics modeling.

4 December 2012 in Advances in Artificial Intelligence
Verified
Journal Article
Open access
PDF file
BOBrian Olson
Brian Olson
IHIrina Hashmi
Irina Hashmi
KMKevin Molloy
Kevin Molloy
Amarda  ShehuAmarda Shehu
Amarda Shehu
Since its introduction, the basin hopping (BH) framework has proven useful for hard nonlinear optimization problems with multiple variables and modalities. Applications span a wide range, from packing problems in geometry to characterization of molecular states in statistical physics. BH is seeing a reemergence in computational structural biology due to its ability to obtain a coarse-grained representation of the protein energy surface in terms of local minima. In this paper, we show that the BH framework is general and versatile, allowing to address problems related to the characterization of protein structure, assembly, and motion due to its fundamental ability to sample minima in a high-dimensional variable space. We show how specific implementations of the main components in BH yield algorithmic realizations that attain state-of-the-art results in the context of ab initio protein structure prediction and rigid protein-protein docking. We also show that BH can map intermediate minima related with motions connecting diverse stable functionally relevant states in a protein molecule, thus serving as a first step towards the characterization of transition trajectories connecting these states.

17 July 2014 in PLOS ONE
Verified
Journal Article
Open access
PDF file
UKUday Kamath
Uday Kamath
KJKenneth De Jong
Kenneth De Jong
Amarda  ShehuAmarda Shehu
Amarda Shehu
Many open problems in bioinformatics involve elucidating underlying functional signals in biological sequences. DNA sequences, in particular, are characterized by rich architectures in which functional signals are increasingly found to combine local and distal interactions at the nucleotide level. Problems of interest include detection of regulatory regions, splice sites, exons, hypersensitive sites, and more. These problems naturally lend themselves to formulation as classification problems in machine learning. When classification is based on features extracted from the sequences under investigation, success is critically dependent on the chosen set of features. We present an algorithmic framework (EFFECT) for automated detection of functional signals in biological sequences. We focus here on classification problems involving DNA sequences which state-of-the-art work in machine learning shows to be challenging and involve complex combinations of local and distal features. EFFECT uses a two-stage process to first construct a set of candidate sequence-based features and then select a most effective subset for the classification task at hand. Both stages make heavy use of evolutionary algorithms to efficiently guide the search towards informative features capable of discriminating between sequences that contain a particular functional signal and those that do not. To demonstrate its generality, EFFECT is applied to three separate problems of importance in DNA research: the recognition of hypersensitive sites, splice sites, and ALU sites. Comparisons with state-of-the-art algorithms show that the framework is both general and powerful. In addition, a detailed analysis of the constructed features shows that they contain valuable biological information about DNA architecture, allowing biologists and other researchers to directly inspect the features and potentially use the insights obtained to assist wet-laboratory studies on retainment or modification of a specific signal. Code, documentation, and all data for the applications presented here are provided for the community at http://www.cs.gmu.edu/~ashehu/?q=OurTools.

8 October 2013 in BioEssays
Verified
Journal Article
Closed access
PDF file
Nadine KabbaniNadine Kabbani
Nadine Kabbani
JNJacob C. Nordman
Jacob C. Nordman
BCBrian A. Corgiat
Brian A. Corgiat
DVDaniel P. Veltri
Daniel P. Veltri
Amarda  ShehuAmarda Shehu
Amarda Shehu
David J. AdamsDavid J. Adams
David J. Adams

22 August 2006 in Proteins: Structure, Function, and Bioinformatics
Verified
Journal Article
Closed access
PDF file
Amarda  ShehuAmarda Shehu
Amarda Shehu
CCCecilia Clementi
Cecilia Clementi
LKLydia Kavraki
Lydia Kavraki