Open Access. Powered by Scholars. Published by Universities.®

Theory and Algorithms Commons

Open Access. Powered by Scholars. Published by Universities.®

Life Sciences

Institution
Keyword
Publication Year
Publication
Publication Type

Articles 61 - 79 of 79

Full-Text Articles in Theory and Algorithms

Graph-Based Regularization In Machine Learning: Discovering Driver Modules In Biological Networks, Xi Gao Jan 2015

Graph-Based Regularization In Machine Learning: Discovering Driver Modules In Biological Networks, Xi Gao

Theses and Dissertations

Curiosity of human nature drives us to explore the origins of what makes each of us different. From ancient legends and mythology, Mendel's law, Punnett square to modern genetic research, we carry on this old but eternal question. Thanks to technological revolution, today's scientists try to answer this question using easily measurable gene expression and other profiling data. However, the exploration can easily get lost in the data of growing volume, dimension, noise and complexity. This dissertation is aimed at developing new machine learning methods that take data from different classes as input, augment them with knowledge of feature relationships, …


Learning Emotions: A Software Engine For Simulating Realistic Emotion In Artificial Agents, Douglas Code Jan 2015

Learning Emotions: A Software Engine For Simulating Realistic Emotion In Artificial Agents, Douglas Code

Senior Independent Study Theses

This paper outlines a software framework for the simulation of dynamic emotions in simulated agents. This framework acts as a domain-independent, black-box solution for giving actors in games or simulations realistic emotional reactions to events. The emotion management engine provided by the framework uses a modified Fuzzy Logic Adaptive Model of Emotions (FLAME) model, which lets it manage both appraisal of events in relation to an individual’s emotional state, and learning mechanisms through which an individual’s emotional responses to a particular event or object can change over time. In addition to the FLAME model, the engine draws on the design …


De Novo Protein Structure Modeling And Energy Function Design, Lin Chen Jan 2015

De Novo Protein Structure Modeling And Energy Function Design, Lin Chen

Computer Science Theses & Dissertations

The two major challenges in protein structure prediction problems are (1) the lack of an accurate energy function and (2) the lack of an efficient search algorithm. A protein energy function accurately describing the interaction between residues is able to supervise the optimization of a protein conformation, as well as select native or native-like structures from numerous possible conformations. An efficient search algorithm must be able to reduce a conformational space to a reasonable size without missing the native conformation. My PhD research studies focused on these two directions.

A protein energy function—the distance and orientation dependent energy function of …


Hash-Map-Eradicator: Filtering Non-Target Sequences From Next Generation Sequencing Reads, Jonathon Brenner, Catherine Putonti Jan 2015

Hash-Map-Eradicator: Filtering Non-Target Sequences From Next Generation Sequencing Reads, Jonathon Brenner, Catherine Putonti

Bioinformatics Faculty Publications

Contemporary DNA sequencing technologies are continuously increasing throughput at ever decreasing costs. Moreover, due to recent advances in sequencing technology new platforms are emerging. As such computational challenges persist. The average read length possible has taken a giant leap forward with the PacBio and Nanopore solutions. Regardless of the platform used, impurities within the DNA preparation of the sample - be it from unintentional contaminants or pervasive symbiots - remains an issue. We have developed a new tool, HAsh-MaP-ERadicator (HAMPER), for the detection and removal of non-target, contaminating DNA sequences. Integrating hash-based and mapping-based strategies, HAMPER is both memory and …


Comparison Of Sequence Alignment Algorithms, Tejas Gandhi Aug 2014

Comparison Of Sequence Alignment Algorithms, Tejas Gandhi

Journal of Undergraduate Research at Minnesota State University, Mankato

The fact that biological sequences can be represented as strings belonging to a finite alphabet (A, C, G, and T for DNA) plays an important role in connecting biology to computer science. String representation allows researchers to apply various string comparison techniques available in computer science. As a result, various applications have been developed that facilitate the task of sequence alignment. The problem of finding sequence alignments consists of finding the best match between two biological sequences. A best match can infer an evolutionary relationship and functional similarity. However, there is a lack of research on how reliable and efficient …


Information In Biological Systems And The Fluctuation Theorem, Yaşar Demirel Jan 2014

Information In Biological Systems And The Fluctuation Theorem, Yaşar Demirel

Department of Chemical and Biomolecular Engineering: Faculty Publications

Some critical trends in information theory, its role in living systems and utilization in fluctuation theory are discussed. The mutual information of thermodynamic coupling is incorporated into the generalized fluctuation theorem by using information theory and nonequilibrium thermodynamics. Thermodynamically coupled dissipative structures in living systems are capable of degrading more energy, and processing complex information through developmental and environmental constraints. The generalized fluctuation theorem can quantify the hysteresis observed in the amount of the irreversible work in nonequilibrium regimes in the presence of information and thermodynamic coupling.


A Genetic Algorithm-Based Feature Selection, Oluleye H. Babatunde, Leisa Armstrong, Jinsong Leng, Dean Diepeveen Jan 2014

A Genetic Algorithm-Based Feature Selection, Oluleye H. Babatunde, Leisa Armstrong, Jinsong Leng, Dean Diepeveen

Research outputs 2014 to 2021

This article details the exploration and application of Genetic Algorithm (GA) for feature selection. Particularly a binary GA was used for dimensionality reduction to enhance the performance of the concerned classifiers. In this work, hundred (100) features were extracted from set of images found in the Flavia dataset (a publicly available dataset). The extracted features are Zernike Moments (ZM), Fourier Descriptors (FD), Lengendre Moments (LM), Hu 7 Moments (Hu7M), Texture Properties (TP) and Geometrical Properties (GP). The main contributions of this article are (1) detailed documentation of the GA Toolbox in MATLAB and (2) the development of a GA-based feature …


Genetic Algorithm With Logistic Regression For Prediction Of Progression To Alzheimer's Disease, Piers Johnson, Luke Vandewater, William Wilson, Paul Maruff, Greg Savage, Petra Graham, Lance S. Macaulay, Kathryn A. Ellis, Cassandra Szoeke, Ralph N. Martins, Christopher Rowe, Colin L. Masters, David Ames, Ping Zhang Jan 2014

Genetic Algorithm With Logistic Regression For Prediction Of Progression To Alzheimer's Disease, Piers Johnson, Luke Vandewater, William Wilson, Paul Maruff, Greg Savage, Petra Graham, Lance S. Macaulay, Kathryn A. Ellis, Cassandra Szoeke, Ralph N. Martins, Christopher Rowe, Colin L. Masters, David Ames, Ping Zhang

Research outputs 2014 to 2021

Assessment of risk and early diagnosis of Alzheimer's disease (AD) is a key to its prevention or slowing the progression of the disease. Previous research on risk factors for AD typically utilizes statistical comparison tests or stepwise selection with regression models. Outcomes of these methods tend to emphasize single risk factors rather than a combination of risk factors. However, a combination of factors, rather than any one alone, is likely to affect disease development. Genetic algorithms (GA) can be useful and efficient for searching a combination of variables for the best achievement (eg. accuracy of diagnosis), especially when the search …


Detection Of Seagrass Scars Using Sparse Coding And Morphological Filter, Ender Oguslu, Sertan Erkanli, Victoria J. Hill, W. Paul Bissett, Richard C. Zimmerman, Jiang Li, Charles R. Bostater Jr. (Ed.), Stelios P. Mertikas (Ed.), Xavier Neyt (Ed.) Jan 2014

Detection Of Seagrass Scars Using Sparse Coding And Morphological Filter, Ender Oguslu, Sertan Erkanli, Victoria J. Hill, W. Paul Bissett, Richard C. Zimmerman, Jiang Li, Charles R. Bostater Jr. (Ed.), Stelios P. Mertikas (Ed.), Xavier Neyt (Ed.)

OES Faculty Publications

We present a two-step algorithm for the detection of seafloor propeller seagrass scars in shallow water using panchromatic images. The first step is to classify image pixels into scar and non-scar categories based on a sparse coding algorithm. The first step produces an initial scar map in which false positive scar pixels may be present. In the second step, local orientation of each detected scar pixel is computed using the morphological directional profile, which is defined as outputs of a directional filter with a varying orientation parameter. The profile is then utilized to eliminate false positives and generate the final …


A Parallel Template For Implementing Filters For Biological Correlation Networks, Kathryn Dempsey Cooper, Vladimir Ufimtsev, Sanjukta Bhowmick, Hesham Ali Jan 2013

A Parallel Template For Implementing Filters For Biological Correlation Networks, Kathryn Dempsey Cooper, Vladimir Ufimtsev, Sanjukta Bhowmick, Hesham Ali

Interdisciplinary Informatics Faculty Publications

High throughput biological experiments are critical for their role in systems biology – the ability to survey the state of cellular mechanisms on the broad scale opens possibilities for the scientific researcher to understand how multiple components come together, and what goes wrong in disease states. However, the data returned from these experiments is massive and heterogeneous, and requires intuitive and clever computational algorithms for analysis. The correlation network model has been proposed as a tool for modeling and analysis of this high throughput data; structures within the model identified by graph theory have been found to represent key players …


Contour Extraction Of Drosophila Embryos Using Active Contours In Scale Space, Soujanya Siddavaram Ananta Dec 2012

Contour Extraction Of Drosophila Embryos Using Active Contours In Scale Space, Soujanya Siddavaram Ananta

Masters Theses & Specialist Projects

Contour extraction of Drosophila embryos is an important step to build a computational system for pattern matching of embryonic images which aids in the discovery of genes. Automatic contour extraction of embryos is challenging due to several image variations such as size, shape, orientation and neigh- boring embryos such as touching and non-touching embryos. In this thesis, we introduce a framework for contour extraction based on the connected components in the gaussian scale space of an embryonic image. The active contour model is applied on the images to refine embryo contours. Data cleaning methods are applied to smooth the jaggy …


Derivation Of Hill's Equation From Scale Invariance, Andres Ortiz^, Vladik Kreinovich* Apr 2012

Derivation Of Hill's Equation From Scale Invariance, Andres Ortiz^, Vladik Kreinovich*

COURI Symposium Abstracts, Spring 2012

No abstract provided.


Derivation Of A Novel Efficient Supervised Learning Algorithm From Cortical-Subcortical Loops, Ashok Chandrashekar, Richard Granger Jan 2012

Derivation Of A Novel Efficient Supervised Learning Algorithm From Cortical-Subcortical Loops, Ashok Chandrashekar, Richard Granger

Dartmouth Scholarship

Although brain circuits presumably carry out powerful perceptual algorithms, few instances of derived biological methods have been found to compete favorably against algorithms that have been engineered for specific applications. We forward a novel analysis of a subset of functions of cortical-subcortical loops, which constitute more than 80% of the human brain, thus likely underlying a broad range of cognitive functions. We describe a family of operations performed by the derived method, including a non-standard method for supervised classification, which may underlie some forms of cortically dependent associative learning. The novel supervised classifier is compared against widely used algorithms for …


Bcc Skin Cancer Diagnosis Based On Texture Analysis Techniques, Shao-Hui Chuang, Xiaoyan Sun, Wen-Yu Chang, Gwo-Shing Chen, Adam Huang, Jiang Li, Frederic D. Mckenzie Jan 2011

Bcc Skin Cancer Diagnosis Based On Texture Analysis Techniques, Shao-Hui Chuang, Xiaoyan Sun, Wen-Yu Chang, Gwo-Shing Chen, Adam Huang, Jiang Li, Frederic D. Mckenzie

Electrical & Computer Engineering Faculty Publications

In this paper, we present a texture analysis based method for diagnosing the Basal Cell Carcinoma (BCC) skin cancer using optical images taken from the suspicious skin regions. We first extracted the Run Length Matrix and Haralick texture features from the images and used a feature selection algorithm to identify the most effective feature set for the diagnosis. We then utilized a Multi-Layer Perceptron (MLP) classifier to classify the images to BCC or normal cases. Experiments showed that detecting BCC cancer based on optical images is feasible. The best sensitivity and specificity we achieved on our data set were 94% …


A Subgroup Algorithm To Identify Cross-Rotation Peaks Consistent With Non-Crystallographic Symmetry, Ryan H. Lilien, Chris Bailey-Kellogg, Amy C. Anderson, Bruce R. Donald Mar 2004

A Subgroup Algorithm To Identify Cross-Rotation Peaks Consistent With Non-Crystallographic Symmetry, Ryan H. Lilien, Chris Bailey-Kellogg, Amy C. Anderson, Bruce R. Donald

Dartmouth Scholarship

Molecular replacement (MR) often plays a prominent role in determining initial phase angles for structure determination by X-ray crystallography. In this paper, an efficient quaternion-based algorithm is presented for analyzing peaks from a cross-rotation function in order to identify model orientations consistent with proper non-crystallographic symmetry (NCS) and to generate proper NCS-consistent orientations missing from the list of cross-rotation peaks. The algorithm, CRANS, analyzes the rotation differences between each pair of cross-rotation peaks to identify finite subgroups. Sets of rotation differences satisfying the subgroup axioms correspond to orientations compatible with the correct proper NCS. The CRANS algorithm was first …


Fast And Space-Efficient Location Of Heavy Or Dense Segments In Run-Length Encoded Sequences, Ronald I. Greenberg Jul 2003

Fast And Space-Efficient Location Of Heavy Or Dense Segments In Run-Length Encoded Sequences, Ronald I. Greenberg

Computer Science: Faculty Publications and Other Works

This paper considers several variations of an optimization problem with potential applications in such areas as biomolecular sequence analysis and image processing. Given a sequence of items, each with a weight and a length, the goal is to find a subsequence of consecutive items of optimal value, where value is either total weight or total weight divided by total length. There may also be a specified lower and/or upper bound on the acceptable length of subsequences. This paper shows that all the variations of the problem are solvable in linear time and space even with non-uniform item lengths and divisible …


Ordering Genetic Algorithm Genomes With Reconstructability Analysis, Stephen Shervais, Martin Zwick Jan 2003

Ordering Genetic Algorithm Genomes With Reconstructability Analysis, Stephen Shervais, Martin Zwick

Complex Systems Faculty Publications and Presentations

The building block hypothesis implies that genetic algorithm effectiveness is influenced by the relative location of epistatic genes on the chromosome. We find that this influence exists, but depends on the generation in which it is measured. Early in the search process it may be more effective to have epistatic genes widely separated. Late in the search process, effectiveness is improved when they are close together. The early search effect is weak but still statistically significant; the late search effect is much stronger and plainly visible. We demonstrate both effects with a set of simple problems, and show that infonnation-theoretic …


Mining Of Correlated Rules In Genome Sequences, L. Lin, L. Wong, Tze-Yun Leong, P. S. Lai Nov 2002

Mining Of Correlated Rules In Genome Sequences, L. Lin, L. Wong, Tze-Yun Leong, P. S. Lai

Research Collection School Of Computing and Information Systems

With the huge amount of data collected by scientists in the molecular genetics community in recent years, there exists a need to develop some novel algorithms based on existing data mining techniques to discover useful information from genome databases. We propose an algorithm that integrates the statistical method, association rule mining, and classification rule mining in the discovery of allelic combinations of genes that are peculiar to certain phenotypes of diseased patients.


Entropy Generation Method To Quantify Thermal Comfort, S. C. Boregowda, S. N. Tiwari, S. K. Chaturvedi Jan 2001

Entropy Generation Method To Quantify Thermal Comfort, S. C. Boregowda, S. N. Tiwari, S. K. Chaturvedi

Mechanical & Aerospace Engineering Faculty Publications

The present paper presents a thermodynamic approach to assess the quality of human-thermal environment interaction and quantify thermal comfort. The approach involves development of entropy generation term by applying second law of thermodynamics to the combined human-environment system. The entropy generation term combines both human thermal physiological responses and thermal environmental variables to provide an objective measure of thermal comfort. The original concepts and definitions form the basis for establishing the mathematical relationship between thermal comfort and entropy generation term. As a result of logic and deterministic approach, an Objective Thermal Comfort Index (OTCI) is defined and established as a …