Open Access. Powered by Scholars. Published by Universities.®
Discrete Mathematics and Combinatorics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Institution
- Keyword
-
- Bioinformatics (2)
- Graph theory (2)
- 1-Nested Networks (1)
- 2-Nested Networks (1)
- Applied math (1)
-
- Big data (1)
- Biology (1)
- Bridget Tenner (1)
- COVID-19 (1)
- Christopher Beasley (1)
- Clustering (1)
- Community detection (1)
- Correlation (1)
- Cystic fibrosis (1)
- Data mining (1)
- Differential equations (1)
- Dynamical systems (1)
- Dynamics (1)
- Elimination of Forever Chemicals (1)
- Euler-Lagrange equation (1)
- Exponential Generating Functions (1)
- FPT (1)
- Food Scarcity (1)
- Formerly Incarcerated College Graduates Network (1)
- G-lattice (1)
- Gene networks (1)
- Genetics (1)
- Gompertz difference equation (1)
- Graph-theoretic Models (1)
- Graphical invariants (1)
- Publication Year
- Publication
- Publication Type
Articles 1 - 23 of 23
Full-Text Articles in Discrete Mathematics and Combinatorics
Reducing Food Scarcity: The Benefits Of Urban Farming, S.A. Claudell, Emilio Mejia
Reducing Food Scarcity: The Benefits Of Urban Farming, S.A. Claudell, Emilio Mejia
Journal of Nonprofit Innovation
Urban farming can enhance the lives of communities and help reduce food scarcity. This paper presents a conceptual prototype of an efficient urban farming community that can be scaled for a single apartment building or an entire community across all global geoeconomics regions, including densely populated cities and rural, developing towns and communities. When deployed in coordination with smart crop choices, local farm support, and efficient transportation then the result isn’t just sustainability, but also increasing fresh produce accessibility, optimizing nutritional value, eliminating the use of ‘forever chemicals’, reducing transportation costs, and fostering global environmental benefits.
Imagine Doris, who is …
Msis-Kadelka: Algebraic Methods For Inferring Discrete Models Of Biological Networks, Brandilyn Stigler
Msis-Kadelka: Algebraic Methods For Inferring Discrete Models Of Biological Networks, Brandilyn Stigler
Annual Symposium on Biomathematics and Ecology Education and Research
No abstract provided.
Modularity And Boolean Network Decomposition, Matthew Wheeler
Modularity And Boolean Network Decomposition, Matthew Wheeler
Annual Symposium on Biomathematics and Ecology Education and Research
No abstract provided.
Rippled Almost Periodic Behavior In An Epilepsy Model, David Chan, Candace Kent
Rippled Almost Periodic Behavior In An Epilepsy Model, David Chan, Candace Kent
Annual Symposium on Biomathematics and Ecology Education and Research
No abstract provided.
Identification Of Control Targets In Boolean Networks Via Computational Algebra, Alan Veliz-Cuba
Identification Of Control Targets In Boolean Networks Via Computational Algebra, Alan Veliz-Cuba
Annual Symposium on Biomathematics and Ecology Education and Research
No abstract provided.
Building Model Prototypes From Time-Course Data, David Murrugarra, Alan Veliz-Cuba
Building Model Prototypes From Time-Course Data, David Murrugarra, Alan Veliz-Cuba
Annual Symposium on Biomathematics and Ecology Education and Research
No abstract provided.
Spring 2021
Scientia
From the Dean: A Decade of Purpose and Progress; Lab Notes: Alumna Wins Gordon Bell Special Prize, New Scholarships, Vaccination Site Volunteers; Women in Science Lecture, National Institutes of Health Grants, "Unequal Cities" Research; All Hands on Deck: Inspired pandemic approaches showcase interdisciplinary acumen in action; Unlocking Potential: Christopher Beasley thinks psychology is key to academic transformation for the formerly incarcerated; Puzzle Master: Bridget Tenner goes to pieces solving problems in cutting-edge mathematics
An Enumeration Of Nested Networks, Nathan Cornelius
An Enumeration Of Nested Networks, Nathan Cornelius
Williams Honors College, Honors Research Projects
Nested networks have several applications in phylogenetics and electrical circuit theory. In many cases, there may exist more than one distinct network which correctly models a given data set. This proposes a combinatorial problem to determine all possible network solutions. In this paper, we partially solve this problem by developing exponential generating functions which enumerate all 1-nested and 2-nested unicyclic networks. We also describe our procedure to directly count all 1-nested and 2-nested networks and provide all 1-nested networks with 7, 8, and 9 terminal nodes.
Sdrap: An Annotation Pipeline For Highly Scrambled Genomes, Jasper Braun
Sdrap: An Annotation Pipeline For Highly Scrambled Genomes, Jasper Braun
Annual Symposium on Biomathematics and Ecology Education and Research
No abstract provided.
Loop Homology Of Bi-Secondary Structures, Andrei Bura
Loop Homology Of Bi-Secondary Structures, Andrei Bura
Annual Symposium on Biomathematics and Ecology Education and Research
No abstract provided.
On An Enhancement Of Rna Probing Data Using Information Theory, Thomas J.X. Li, Christian M. Reidys
On An Enhancement Of Rna Probing Data Using Information Theory, Thomas J.X. Li, Christian M. Reidys
Annual Symposium on Biomathematics and Ecology Education and Research
No abstract provided.
Combinatorial Geometry Of Threshold-Linear Networks, Christopher Langdon
Combinatorial Geometry Of Threshold-Linear Networks, Christopher Langdon
Annual Symposium on Biomathematics and Ecology Education and Research
No abstract provided.
Efficient Reduced Bias Genetic Algorithm For Generic Community Detection Objectives, Aditya Karnam Gururaj Rao
Efficient Reduced Bias Genetic Algorithm For Generic Community Detection Objectives, Aditya Karnam Gururaj Rao
Theses
The problem of community structure identification has been an extensively investigated area for biology, physics, social sciences, and computer science in recent years for studying the properties of networks representing complex relationships. Most traditional methods, such as K-means and hierarchical clustering, are based on the assumption that communities have spherical configurations. Lately, Genetic Algorithms (GA) are being utilized for efficient community detection without imposing sphericity. GAs are machine learning methods which mimic natural selection and scale with the complexity of the network. However, traditional GA approaches employ a representation method that dramatically increases the solution space to be searched by …
Dynamics Of Gene Networks In Cancer Research, Paul Scott
Dynamics Of Gene Networks In Cancer Research, Paul Scott
Electronic Theses and Dissertations
Cancer prevention treatments are being researched to see if an optimized treatment schedule would decrease the likelihood of a person being diagnosed with cancer. To do this we are looking at genes involved in the cell cycle and how they interact with one another. Through each gene expression during the life of a normal cell we get an understanding of the gene interactions and test these against those of a cancerous cell. First we construct a simplified network model of the normal gene network. Once we have this model we translate it into a transition matrix and force changes on …
Network Analytics For The Mirna Regulome And Mirna-Disease Interactions, Joseph Jayakar Nalluri
Network Analytics For The Mirna Regulome And Mirna-Disease Interactions, Joseph Jayakar Nalluri
Theses and Dissertations
miRNAs are non-coding RNAs of approx. 22 nucleotides in length that inhibit gene expression at the post-transcriptional level. By virtue of this gene regulation mechanism, miRNAs play a critical role in several biological processes and patho-physiological conditions, including cancers. miRNA behavior is a result of a multi-level complex interaction network involving miRNA-mRNA, TF-miRNA-gene, and miRNA-chemical interactions; hence the precise patterns through which a miRNA regulates a certain disease(s) are still elusive. Herein, I have developed an integrative genomics methods/pipeline to (i) build a miRNA regulomics and data analytics repository, (ii) create/model these interactions into networks and use optimization techniques, motif …
Bounds On The Expected Size Of The Maximum Agreement Subtree, Colby Long, Daniel Irving Bernstein, Lam Si Tung Ho, Mike Steel, Katherine St. John, Seth Sullivant
Bounds On The Expected Size Of The Maximum Agreement Subtree, Colby Long, Daniel Irving Bernstein, Lam Si Tung Ho, Mike Steel, Katherine St. John, Seth Sullivant
Annual Symposium on Biomathematics and Ecology Education and Research
No abstract provided.
Exploring The Space Of Rna Secondary Structures, Heather C. Smith
Exploring The Space Of Rna Secondary Structures, Heather C. Smith
Annual Symposium on Biomathematics and Ecology Education and Research
No abstract provided.
Hill's Diagrammatic Method And Reduced Graph Powers, Gregory D. Smith, Richard Hammack
Hill's Diagrammatic Method And Reduced Graph Powers, Gregory D. Smith, Richard Hammack
Biology and Medicine Through Mathematics Conference
No abstract provided.
A Hierarchical Graph For Nucleotide Binding Domain 2, Samuel Kakraba
A Hierarchical Graph For Nucleotide Binding Domain 2, Samuel Kakraba
Electronic Theses and Dissertations
One of the most prevalent inherited diseases is cystic fibrosis. This disease is caused by a mutation in a membrane protein, the cystic fibrosis transmembrane conductance regulator (CFTR). CFTR is known to function as a chloride channel that regulates the viscosity of mucus that lines the ducts of a number of organs. Generally, most of the prevalent mutations of CFTR are located in one of two nucleotide binding domains, namely, the nucleotide binding domain 1 (NBD1). However, some mutations in nucleotide binding domain 2 (NBD2) can equally cause cystic fibrosis. In this work, a hierarchical graph is built for NBD2. …
A Predictive Model Which Uses Descriptors Of Rna Secondary Structures Derived From Graph Theory., Alissa Ann Rockney
A Predictive Model Which Uses Descriptors Of Rna Secondary Structures Derived From Graph Theory., Alissa Ann Rockney
Electronic Theses and Dissertations
The secondary structures of ribonucleic acid (RNA) have been successfully modeled with graph-theoretic structures. Often, simple graphs are used to represent secondary RNA structures; however, in this research, a multigraph representation of RNA is used, in which vertices represent stems and edges represent the internal motifs. Any type of RNA secondary structure may be represented by a graph in this manner. We define novel graphical invariants to quantify the multigraphs and obtain characteristic descriptors of the secondary structures. These descriptors are used to train an artificial neural network (ANN) to recognize the characteristics of secondary RNA structure. Using the ANN, …
The Maximum Clique Problem: Algorithms, Applications, And Implementations, John David Eblen
The Maximum Clique Problem: Algorithms, Applications, And Implementations, John David Eblen
Doctoral Dissertations
Computationally hard problems are routinely encountered during the course of solving practical problems. This is commonly dealt with by settling for less than optimal solutions, through the use of heuristics or approximation algorithms. This dissertation examines the alternate possibility of solving such problems exactly, through a detailed study of one particular problem, the maximum clique problem. It discusses algorithms, implementations, and the application of maximum clique results to real-world problems. First, the theoretical roots of the algorithmic method employed are discussed. Then a practical approach is described, which separates out important algorithmic decisions so that the algorithm can be easily …
Discrete Fractional Calculus And Its Applications To Tumor Growth, Sevgi Sengul
Discrete Fractional Calculus And Its Applications To Tumor Growth, Sevgi Sengul
Masters Theses & Specialist Projects
Almost every theory of mathematics has its discrete counterpart that makes it conceptually easier to understand and practically easier to use in the modeling process of real world problems. For instance, one can take the "difference" of any function, from 1st order up to the n-th order with discrete calculus. However, it is also possible to extend this theory by means of discrete fractional calculus and make n- any real number such that the ½-th order difference is well defined. This thesis is comprised of five chapters that demonstrate some basic definitions and properties of discrete fractional calculus …
A Decomposition Of The Pure Parsimony Problem, Allen Holder, Thomas M. Langley
A Decomposition Of The Pure Parsimony Problem, Allen Holder, Thomas M. Langley
Mathematical Sciences Technical Reports (MSTR)
We partially order a collection of genotypes so that we can represent the problem of inferring the least number of haplotypes in terms of substructures we call g-lattices. This representation allows us to prove that if the genotypes partition into chains with certain structure, then the NP-Hard problem can be solved efficiently. Even without the specified structure, the decomposition shows how to separate the underlying integer programming model into smaller models.