Khalid Sayood

Prof. Khalid Sayood

University of Nebraska - Lincoln
orcid

Research Focus & Metrics

Academic Career Length

35Years (1992-Present)

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

Representative Publications

View All Publications
31 January 2011 in BMC Bioinformatics
Verified
Journal Article
Open access
PDF file
ONOzkan U Nalbantoglu
Ozkan U Nalbantoglu
SWSamuel F Way
Samuel F Way
SHSteven H Hinrichs
Steven H Hinrichs
Khalid SayoodKhalid Sayood
Khalid Sayood
Computational analysis of metagenomes requires the taxonomical assignment of the genome contigs assembled from DNA reads of environmental samples. Because of the diverse nature of microbiomes, the length of the assemblies obtained can vary between a few hundred bp to a few hundred Kbp. Current taxonomic classification algorithms provide accurate classification for long contigs or for short fragments from organisms that have close relatives with annotated genomes. These are significant limitations for metagenome analysis because of the complexity of microbiomes and the paucity of existing annotated genomes. We propose a robust taxonomic classification method, RAIphy, that uses a novel sequence similarity metric with iterative refinement of taxonomic models and functions effectively without these limitations. We have tested RAIphy with synthetic metagenomics data ranging between 100 bp to 50 Kbp. Within a sequence read range of 100 bp-1000 bp, the sensitivity of RAIphy ranges between 38%-81% outperforming the currently popular composition-based methods for reads in this range. Comparison with computationally more intensive sequence similarity methods shows that RAIphy performs competitively while being significantly faster. The sensitivity-specificity characteristics for relatively longer contigs were compared with the PhyloPythia and TACOA algorithms. RAIphy performs better than these algorithms at varying clade-levels. For an acid mine drainage (AMD) metagenome, RAIphy was able to taxonomically bin the sequence read set more accurately than the currently available methods, Phymm and MEGAN, and more accurately in two out of three tests than the much more computationally intensive method, PhymmBL. With the introduction of the relative abundance index metric and an iterative classification method, we propose a taxonomic classification algorithm that performs competitively for a large range of DNA contig lengths assembled from metagenome data. Because of its speed, simplicity, and accuracy RAIphy can be successfully used in the binning process for a broad range of metagenomic data obtained from environmental samples.

14 September 2018 in Entropy
Verified
Journal Article
Open access
PDF file
Khalid SayoodKhalid Sayood
Khalid Sayood
We examine how information theory has been used to study cognition over the last seven decades. After an initial burst of activity in the 1950s, the backlash that followed stopped most work in this area. The last couple of decades has seen both a revival of interest, and a more firmly grounded, experimentally justified use of information theory. We can view cognition as the process of transforming perceptions into information—where we use information in the colloquial sense of the word. This last clarification is one of the problems we run into when trying to use information theoretic principles to understand or analyze cognition. Information theory is mathematical, while cognition is a subjective phenomenon. It is relatively easy to discern a subjective connection between cognition and information; it is a different matter altogether to apply the rigor of information theory to the process of cognition. In this paper, we will look at the many ways in which people have tried to alleviate this problem. These approaches range from narrowing the focus to only quantifiable aspects of cognition or borrowing conceptual machinery from information theory to address issues of cognition. We describe applications of information theory across a range of cognition research, from neural coding to cognitive control and predictive coding.

29 December 2009 in Entropy
Verified
Journal Article
Open access
PDF file
ÖNÖzkan U. Nalbantoglu
Özkan U. Nalbantoglu
DRDavid J. Russell
David J. Russell
Khalid SayoodKhalid Sayood
Khalid Sayood
Data compression at its base is concerned with how information is organized in data. Understanding this organization can lead to efficient ways of representing the information and hence data compression. In this paper we review the ways in which ideas and approaches fundamental to the theory and practice of data compression have been used in the area of bioinformatics. We look at how basic theoretical ideas from data compression, such as the notions of entropy, mutual information, and complexity have been used for analyzing biological sequences in order to discover hidden patterns, infer phylogenetic relationships between organisms and study viral populations. Finally, we look at how inferred grammars for biological sequences have been used to uncover structure in biological sequences.

1 January 2003 in Bioinformatics
Verified
Journal Article
Open access
PDF file
Hasan OtuHasan Otu
Hasan Otu
Khalid SayoodKhalid Sayood
Khalid Sayood
Motivation: One of the major problems in DNA sequencing is assembling the fragments obtained by shotgun sequencing. Most existing fragment assembly techniques follow the overlap—layout—consensus approach. This framework requires extensive computation in each phase and becomes inefficient with increasing number of fragments. Results: We propose a new algorithm which solves the overlap, layout, and consensus phases simultaneously. The fragments are clustered with respect to their Average Mutual Information (AMI) profiles using the k-means algorithm. This removes the unnecessary burden of considering the collection of fragments as a whole. Instead, the orientation and overlap detection are solved efficiently, within the clusters. The algorithm has successfully reconstructed both artificial and real data. Availability: Available on request from the authors. Contact: otu@eecomm.unl.edu

23 August 2019 in Algorithms
Verified
Journal Article
Open access
PDF file
AMAmirsalar Mansouri
Amirsalar Mansouri
SSSanjay P. Singh
Sanjay P. Singh
Khalid SayoodKhalid Sayood
Khalid Sayood
Epilepsy is one of the three most prevalent neurological disorders. A significant proportion of patients suffering from epilepsy can be effectively treated if their seizures are detected in a timely manner. However, detection of most seizures requires the attention of trained neurologists—a scarce resource. Therefore, there is a need for an automatic seizure detection capability. A tunable non-patient-specific, non-seizure-specific method is proposed to detect the presence and locality of a seizure using electroencephalography (EEG) signals. This multifaceted computational approach is based on a network model of the brain and a distance metric based on the spectral profiles of EEG signals. This computationally time-efficient and cost-effective automated epileptic seizure detection algorithm has a median latency of 8 s, a median sensitivity of 83%, and a median false alarm rate of 2.9%. Hence, it is capable of being used in portable EEG devices to aid in the process of detecting and monitoring epileptic patients.

1 January 1992 in IEEE Transactions on Communications
Verified
Journal Article
Open access
YCY.-C. Chen
Y.-C. Chen
Khalid SayoodKhalid Sayood
Khalid Sayood
DND.J. Nelson
D.J. Nelson