If a read's mappings to two or more pseudogenomes are identical, Suspenders merges the mappings into one logical unit and tags the mapping with a bit vector to identify the origin.
Now, as in the first-order case, we classify higher-order Lipschitz mappings into three cases, thus T is an rth-order contraction mapping if the polynomial (p z):=z^{r}-sum_{k=0}^{r-1}c_{k}z^{k}) is stable, that is, (|lambda|<1) if (p lambda)=0 ).
Similarly and following the extension of the Banach contraction principle to the case of metric spaces endowed with a partial order, it was natural to try to investigate the case of nonexpansive mappings into such metric spaces.
Direct computations with jets show that: where the dots indicate terms of order higher than 3. Substituting these truncated mappings into the sphere equation: yields: where the dots indicate terms of bidegree (2,4) and (4,2) and higher order.
We divide all possible binary mappings into two mutually exclusive subsets of codon readings.
We loaded these pseudochromosome mappings into our own copy of the ATIDB Arabidopsis genome database [ 13] to enable a programmatic analysis.
