Related papers: A taylor-made arithmetic model of the genetic code…
In this paper, we introduce a new type degenerate Simsek numbers and their generating function, which are different from degenerate Simsek number studied so far. We establish the explicit formula, recurrence relation and other identities…
We supply basic tools for the study of the topological order of a multiplet which is an eigenspace of a finite-dimensional normal operator with continuous parameters. We allow intrinsic degeneracies within the multiplet where a well-known…
Background. Models of ancestral gene order reconstruction have progressively integrated different evolutionary patterns and processes such as unequal gene content, gene duplications, and implicitly sequence evolution via reconciled gene…
We study some essential arithmetic properties of a new tree-based number representation, {\em hereditarily binary numbers}, defined by applying recursively run-length encoding of bijective base-2 digits. Our representation expresses giant…
Motivated by genome-wide association studies, we consider a standard linear model with one additional random effect in situations where many predictors have been collected on the same subjects and each predictor is analyzed separately.…
In this work, we generalize the numerical approach to Gaudin models developed earlier by us to degenerate systems showing that their treatment is surprisingly convenient from a numerical point of view. In fact, high degeneracies not only…
Gene gain-loss-duplication models are commonly based on continuous-time birth-death processes. Employed in a phylogenetic context, such models have been increasingly popular in studies of gene content evolution across multiple genomes.…
The genetic code is the set of rules by which information encoded in genetic material (DNA or RNA sequences) is translated into proteins (amino acid sequences) by living cells. The code defines a mapping between tri-nucleotide sequences,…
In this paper, we introduce the new fully degenerate poly-Bernoulli numbers and polynomials and investigate some properties of these polynomials and numbers. From our properties, we derive some identities for the fully degenerate…
In addition to rather complicated general methods it is interesting and valuable to develop fast efficient methods for calculating generators of power integral bases in special types of number fields. We consider sextic fields containing a…
Requiring stability of genetic code against translation errors, modelised by suitable mathematical operators in the crystal basis model of the genetic code, the main features of the organisation in multiplets of the mitochondrial and of the…
We give algorithms to compute decompositions of a given polynomial, or more generally mixed tensor, as sum of rank one tensors, and to establish whether such a decomposition is unique. In particular, we present methods to compute the…
The Andrews-Curtis conjecture claims that every balanced presentation of the trivial group can be transformed into the trivial presentation by a finite sequence of "elementary transformations" which are Nielsen transformations together with…
Recent work has proven the existence of extreme inbreeding in a European ancestry sample taken from the contemporary UK population \cite{nature_01}. This result brings our attention again to a math problem related to inbreeding family trees…
The aim of this paper is to study the fully degenerate Bernoulli polynomials and numbers, which are a degenerate version of Bernoulli polynomials and numbers and arise naturally from the Volkenborn integral of the degenerate exponential…
We show that our recently published Arithmetic Model of the genetic code based on Godel Encoding is robust against symmetry transformations, specially Rumer s one U > G, A > C, and constitutes a link between the degeneracy structure and the…
This paper presents a new type of genetic algorithm for the set covering problem. It differs from previous evolutionary approaches first because it is an indirect algorithm, i.e. the actual solutions are found by an external decoder…
We introduce a new algorithm called {\sc Rec-Gen} for reconstructing the genealogy or \textit{pedigree} of an extant population purely from its genetic data. We justify our approach by giving a mathematical proof of the effectiveness of…
Genetic programming (GP) is a commonly used approach to solve symbolic regression (SR) problems. Compared with the machine learning or deep learning methods that depend on the pre-defined model and the training dataset for solving SR…
Tissue heterogeneity is a major confounding factor in studying individual populations that cannot be resolved directly by global profiling. Experimental solutions to mitigate tissue heterogeneity are expensive, time consuming, inapplicable…