Related papers: Growth-Algorithm Model of Leaf Shape
The {\sc Directed Maximum Leaf Out-Branching} problem is to find an out-branching (i.e. a rooted oriented spanning tree) in a given digraph with the maximum number of leaves. In this paper, we improve known parameterized algorithms and…
There are a number of ways to procedurally generate interesting three-dimensional shapes, and a method where a cellular neural network is combined with a mesh growth algorithm is presented here. The aim is to create a shape from a genetic…
Tracking of plant cells in images obtained by microscope is a challenging problem due to biological phenomena such as large number of cells, non-uniform growth of different layers of the tightly packed plant cells and cell division.…
Pattern forming systems allow for a wealth of states, where wavelengths and orientation of patterns varies and defects disrupt patches of monocrystalline regions. Growth of patterns has long been recognized as a strong selection mechanism.…
A model of the regular arrangement of leaves on a plant stem (phyllotactic patterns) is proposed, based on a new plant pattern algorithm. Tripartite patterning is proposed to occur by the interaction of two signaling pathways. Each pathway…
Heterogeneous growth plays an important role in the shape and pattern formation of thin elastic structures ranging from the petals of blooming lilies to the cell walls of growing bacteria. Here we address the stability and regulation of…
We derive a course grained, continuum model of the 2D vertex model, applicable for different underlying geometries, and allowing for analytical analysis of an otherwise numerical model. Using a geometric approach and out--of--equilibrium…
Evolving trees arise in many real-life scenarios from computer file systems and dynamic call graphs, to fake news propagation and disease spread. Most layout algorithms for static trees do not work well in an evolving setting (e.g., they…
We present a general approach to study a class of random growth models in $n$-dimensional Euclidean space. These models are designed to capture basic growth features which are expected to manifest at the mesoscopic level for several…
This is a collection of articles, written as sections, on arithmetic properties of differential equations, holomorphic foliations, Gauss-Manin connections and Hodge loci. Each section is independent from the others and it has its own…
Linear model trees are regression trees that incorporate linear models in the leaf nodes. This preserves the intuitive interpretation of decision trees and at the same time enables them to better capture linear relationships, which is hard…
We present an algorithm for classification tasks on big data. Experiments conducted as part of this study indicate that the algorithm can be as accurate as ensemble methods such as random forests or gradient boosted trees. Unlike ensemble…
The self-organization of cells into complex tissues relies on a tight coordination of cell behavior. Identifying the cellular processes driving tissue growth is key to understanding the emergence of tissue forms and devising targeted…
Leaf vein forms the basis of leaf characterization and classification. Different species have different leaf vein patterns. It is seen that leaf vein segmentation will help in maintaining a record of all the leaves according to their…
Collective cell motions underlie structure formation during embryonic development. Tissues exhibit emergent multicellular characteristics such as jamming, rigidity transitions, and glassy dynamics, but there remain questions about how those…
The Watts-Strogatz algorithm of transferring the square lattice to a small world network is modified by introducing preferential rewiring constrained by connectivity demand. The evolution of the network is two-step: sequential preferential…
Network science provides an indispensable theoretical framework for studying the structure and function of real complex systems. Different network models are often used for finding the rules that govern their evolution, whereby the correct…
In this note we analyze the performance of a simple root-finding algorithm in uniform attachment trees. The leaf-stripping algorithm recursively removes all leaves of the tree for a carefully chosen number of rounds. We show that, with…
An evolutionary tree is a rooted tree where each internal vertex has at least two children and where the leaves are labeled with distinct symbols representing species. Evolutionary trees are useful for modeling the evolutionary history of…
Control of gas exchange between a leafs interior and the surrounding air is accomplished by variations in the turgor pressures in the small epidermal and guard cells that cover the leafs surface. These pressures respond to changes in light…