YAYannis Almirantis

Yannis Almirantis

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Yannis Almirantis has a total of 46 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Multistable Synaptic Plasticity Induces Memory Effects and Cohabitation of Chimera and Bump States in Leaky Integrate-and-Fire Networks

    by Astero Provata, Yannis Almirantis, Wentian Li

    Chimera states and bump states are collective synchronization phenomena observed independently (in different parameter regions) in networks of coupled nonlinear oscillators. And while chimera states are characterized by coexistence of coherent and incoherent domains, bump states consist of alternating active and inactive domains. The idea of multistable plasticity in the network connections originates from brain dynamics where the strength of the synapses (axons) connecting the network nodes (neurons) may change dynamically in time; when reaching the steady state the network connections may be found in one of many possible values depending on various factors, such as local connectivity, influence of neighboring cells etc. The sign of the link weights is also a significant factor in the network dynamics: positive weights are characterized as excitatory connections and negative ones as inhibitory. In the present study we consider the simplest case of bistable plasticity, where the link dynamics has only two fixed points. During the system/network integration, the link weights change and as a consequence the network organizes in excitatory or inhibitory domains characterized by different synaptic strengths. We specifically explore the influence of bistable plasticity on collective synchronization states and we numerically demonstrate that the dynamics of the linking may, under special conditions, give rise to co-existence of bump-like and chimera-like states simultaneously in the network. In the case of bump and chimera co-existence, confinement effects appear: the different domains stay localized and do not travel around the network. Memory effects are also reported in the sense that the final spatial arrangement of the coupling strengths reflects some of the local properties of the initial link distribution. For the quantification of the system’s spatial and temporal features, the global and local entropy functions are employed as measures of the network organization, while the average firing rates account for the network evolution and dynamics. In particular, the spatial minima of the local entropy designate the transition points between domains of different synaptic weights in the hybrid states, while the number of minima corresponds to the number of different domains. In addition, the entropy deviations signify the presence of chimera-like or bump-like states in the network.


  • Open Access

    Multistable Synaptic Plasticity induces Memory Effects and Cohabitation of Chimera and Bump States in Leaky Integrate-and-Fire Networks

    by Astero Provata, Yannis Almirantis, Wentian Li

    Chimera states and bump states are collective synchronization phenomena observed independently (at different parameter regions) in networks of coupled nonlinear oscillators. And while chimera states are characterized by coexistence of coherent and incoherent domains, bump states consist of active domains operating on a silent background. Multistable plasticity in the network connections originates from brain dynamics and is based on the idea that neural cells may transmit inhibitory or excitatory signals depending on various factors, such as local connectivity, influence of neighboring cells etc. During the system/network integration, the link weights adapt and, in the case of multistability, they may organize in coexisting excitatory and/or inhibitory domains. Here, we explore the influence of bistable plasticity on collective synchronization states and we numerically demonstrate that the dynamics of the linking may give rise to co-existence of bump-like and chimera-like states simultaneously in the network. In the case of bump and chimera co-existence, confinement effects are developed: the different domains stay localized and do not travel around the network. Memory effects are also reported in the sense that the final spatial arrangement of the coupling strengths reflects some of the local properties of the initial link distribution. For the quantification of the system's spatial and temporal features, the global and local entropy functions are employed as measures of the network organization, while the average firing rates account for the network evolution and dynamics.

  • Noether’s Theorem as a Metaphor for Chargaff’s 2nd Parity Rule in Genomics

    by Yannis Almirantis, Astero Provata, Wentian Li

    In the present note, the genomic compositional rule largely known as ‘Chargaff’s 2nd parity rule’ (asserting equimolarity between Adenine–Thymine and Guanine–Cytosine in any of the two DNA strands) is regarded in association with Noether’s theorem linking symmetries with conservation laws in physics. In the case of the genome, the strict physical and mathematical prerequisites of Noether’s theorem do not hold. However, we conclude that a metaphor can be established with Noether’s theorem, as inter-strand symmetry concerning DNA functionality engenders specific features in genome composition. Inversely, when inter-strand symmetry does not hold, the corresponding quantitative relations fail to appear. This association is also considered from the point of view of the existence of emergent laws and properties in evolutionary genomics.


  • Open Access

    Introduction of ‘Generalized Genomic Signatures’ for the quantification of neighbour preferences leads to taxonomy- and functionality-based distinction among sequences

    by Konstantinos Apostolou-Karampelis, Dimitris Polychronopoulos, Yannis Almirantis

    Analysis of DNA composition at several length scales constitutes the bulk of many early studies aimed at unravelling the complexity of the organization and functionality of genomes. Dinucleotide relative abundances are considered an idiosyncratic feature of genomes, regarded as a ‘genomic signature’. Motivated by this finding, we introduce the ‘Generalized Genomic Signatures’ (GGSs), composed of over- and under-abundances of all oligonucleotides of a given length, thus filtering out compositional trends and neighbour preferences at any shorter range. Previous works on alignment-free genomic comparisons mostly rely on k-mer frequencies and not on distance-dependent neighbour preferences. Therein, nucleotide composition and proximity preferences are combined, while in the present work they are strictly separated, focusing uniquely on neighbour relationships. GGSs retain the potential or even outperform genomic signatures defined at the dinucleotide level in distinguishing between taxonomic subdivisions of bacteria, and can be more effectively implemented in microbial phylogenetic reconstruction. Moreover, we compare DNA sequences from the human genome corresponding to protein coding segments, conserved non-coding elements and non-functional DNA stretches. These classes of sequences have distinctive GGSs according to their genomic role and degree of conservation. Overall, GGSs constitute a trait characteristic of the evolutionary origin and functionality of different genomic segments.


  • Open Access

    Ultra-High Dilutions and Homeopathy: Can They Be Explained without Non-Local Theory?

    by Konstantinos Tsitinidis, Yannis Almirantis

    We discuss questions related to the ‘Benveniste Affair’, its consequences and broader issues in an attempt to understand homeopathy. Specifically, we address the following points: 1. The relationship between the experiments conducted by Benveniste, Montagnier, their collaborators and groups that independently tested their results, to ‘traditional’ homeopathy. 2. Possible non-local components such as ‘generalised entanglement’ as the basis of the homeopathic phenomenon and experimental evidence for them. 3. The capability of highly diluted homeopathic remedies to provoke tangible biological changes in whole organisms and cellular experimental systems. 4. Aspects of the similia principle related to the above. 5. Suggestions that can lead to experimental verifications of the non-local hypothesis in homeopathy. • Non-local explanations for the effects of homeopathy arose from the controversial work of Jacques Benveniste. • An attempt to demonstrate transmission of the activity of a potentised solution was unsuccessful, but a critical experimenter effect was detected. • Multiple repetitions of the human basophil degranulation experiments similar to Benveniste's have shown positive results. • Other workers have proposed non-local hypotheses based on weak quantum theory. These have some experimental support.


  • Open Access

    Optimal Computation of Overabundant Words

    by Yannis Almirantis, Panagiotis Charalampopoulos, Jia Gao, Costas S. Iliopoulos, Manal Mohamed, Solon P. Pissis, Dimitris Polychronopoulos

    The observed frequency of the longest proper prefix, the longest proper suffix, and the longest infix of a word $w$ in a given sequence $x$ can be used for classifying $w$ as avoided or overabundant. The definitions used for the expectation and deviation of $w$ in this statistical model were described and biologically justified by Brendel et al. (J Biomol Struct Dyn 1986). We have very recently introduced a time-optimal algorithm for computing all avoided words of a given sequence over an integer alphabet (Algorithms Mol Biol 2017). In this article, we extend this study by presenting an $\mathcal{O}(n)$-time and $\mathcal{O}(n)$-space algorithm for computing all overabundant words in a sequence $x$ of length $n$ over an integer alphabet. Our main result is based on a new non-trivial combinatorial property of the suffix tree $\mathcal{T}$ of $x$: the number of distinct factors of $x$ whose longest infix is the label of an explicit node of $\mathcal{T}$ is no more than $3n-4$. We further show that the presented algorithm is time-optimal by proving that $\mathcal{O}(n)$ is a tight upper bound for the number of overabundant words. Finally, we present experimental results, using both synthetic and real data, which justify the effectiveness and efficiency of our approach in practical terms.

  • Open Access

    On avoided words, absent words, and their application to biological sequence analysis

    by Yannis Almirantis, Panagiotis Charalampopoulos, Jia Gao, Costas S. Iliopoulos, Manal Mohamed, Solon P. Pissis, Dimitris Polychronopoulos

    The deviation of the observed frequency of a word w from its expected frequency in a given sequence x is used to determine whether or not the word is avoided. This concept is particularly useful in DNA linguistic analysis. The value of the deviation of w, denoted by $$\textit{dev}(w)$$ dev ( w ) , effectively characterises the extent of a word by its edge contrast in the context in which it occurs. A word w of length $$k>2$$ k > 2 is a $$\rho $$ ρ -avoided word in x if $$\textit{dev}(w) \le \rho $$ dev ( w ) ≤ ρ , for a given threshold $$\rho < 0$$ ρ < 0 . Notice that such a word may be completely absent from x. Hence, computing all such words naïvely can be a very time-consuming procedure, in particular for large k. In this article, we propose an $$\mathcal {O}(n)$$ O ( n ) -time and $$\mathcal {O}(n)$$ O ( n ) -space algorithm to compute all $$\rho $$ ρ -avoided words of length k in a given sequence of length n over a fixed-sized alphabet. We also present a time-optimal $$\mathcal {O}(\sigma n)$$ O ( σ n ) -time algorithm to compute all $$\rho $$ ρ -avoided words (of any length) in a sequence of length n over an integer alphabet of size $$\sigma $$ σ . In addition, we provide a tight asymptotic upper bound for the number of $$\rho $$ ρ -avoided words over an integer alphabet and the expected length of the longest one. We make available an implementation of our algorithm. Experimental results, using both real and synthetic data, show the efficiency and applicability of our implementation in biological sequence analysis. The systematic search for avoided words is particularly useful for biological sequence analysis. We present a linear-time and linear-space algorithm for the computation of avoided words of length k in a given sequence x. We suggest a modification to this algorithm so that it computes all avoided words of x, irrespective of their length, within the same time complexity. We also present combinatorial results with regards to avoided words and absent words.


  • Open Access

    A novel skew analysis reveals substitution asymmetries linked to genetic code GC-biases and PolIII a-subunit isoforms

    by Konstantinos Apostolou-Karampelis, Christoforos Nikolaou, Yannis Almirantis

    Strand biases reflect deviations from a null expectation of DNA evolution that assumes strand-symmetric substitution rates. Here, we present strong evidence that nearest-neighbour preferences are a strand-biased feature of bacterial genomes, indicating neighbour-dependent substitution asymmetries. To detect such asymmetries we introduce an alignment free index (relative abundance skews). The profiles of relative abundance skews along coding sequences can trace the phylogenetic relations of bacteria, suggesting that the patterns of neighbour-dependent substitution strand-biases are not common among different lineages, but are rather species-specific. Analysis of neighbour-dependent and codon-site skews sheds light on the origins of substitution asymmetries. Via a simple model we argue that the structure of the genetic code imposes position-dependent substitution strand-biases along coding sequences, as a response to GC mutation pressure. Thus, the organization of the genetic code per se can lead to an uneven distribution of nucleotides among different codon sites, even when requirements for specific codons and amino-acids are not accounted for. Moreover, our results suggest that strand-biases in replication fidelity of PolIII α-subunit induce substitution asymmetries, both neighbour-dependent and independent, on a genome scale. The role of DNA repair systems, such as transcription-coupled repair, is also considered.


  • Fractality and entropic scaling in the chromosomal distribution of conserved noncoding elements in the human genome

    by Dimitris Polychronopoulos, Labrini Athanasopoulou, Yannis Almirantis


  • Open Access

    Optimal Computation of Avoided Words

    by Yannis Almirantis, Panagiotis Charalampopoulos, Jia Gao, Costas S. Iliopoulos, Manal Mohamed, Solon P. Pissis, Dimitris Polychronopoulos

    The deviation of the observed frequency of a word $w$ from its expected frequency in a given sequence $x$ is used to determine whether or not the word is avoided. This concept is particularly useful in DNA linguistic analysis. The value of the standard deviation of $w$, denoted by $std(w)$, effectively characterises the extent of a word by its edge contrast in the context in which it occurs. A word $w$ of length $k>2$ is a $\rho$-avoided word in $x$ if $std(w) \leq \rho$, for a given threshold $\rho < 0$. Notice that such a word may be completely absent from $x$. Hence computing all such words na\"{\i}vely can be a very time-consuming procedure, in particular for large $k$. In this article, we propose an $O(n)$-time and $O(n)$-space algorithm to compute all $\rho$-avoided words of length $k$ in a given sequence $x$ of length $n$ over a fixed-sized alphabet. We also present a time-optimal $O(\sigma n)$-time and $O(\sigma n)$-space algorithm to compute all $\rho$-avoided words (of any length) in a sequence of length $n$ over an alphabet of size $\sigma$. Furthermore, we provide a tight asymptotic upper bound for the number of $\rho$-avoided words and the expected length of the longest one. We make available an open-source implementation of our algorithm. Experimental results, using both real and synthetic data, show the efficiency of our implementation.