Insertion-Deletion Networks

Word networks - collections of words of a common length that can be joined by single-letter substitutions, such as the sequence BANKER-BANTER-BATTER-BETTER-SETTER-SETTEE-SETTLE linking BANKER and SETTLE - were studied in some detail in the May and August 1973 issues of Word Ways. Non-repeating sequences from word networks, commonly called word ladders and doublets, have a long history; Lewis Carroll, among others, challenged readers to join two specified words by a ladder. However, word networks have one serious flaw: they do not allow one to incorporate words of different lengths. This can be rectified by the concept of an insertion-deletion network, in which a word of n letters is linked to a word of n-1 letters if the first can be converted to the second by the deletion of a single letter. (In the reverse direction, the linage is called the insertion of a letter in a word to form another word.) Extremely complex insertion-deletion networks containing many loops and branches can be constructed; by examining them, one can easily ascertain whether or not one word can be reached from another by successive insertions and deletions. Further, one can calculate the minimum number of such steps required

Structural Changes in Data Communication in Wireless Sensor Networks

Wireless sensor networks are an important technology for making distributed autonomous measures in hostile or inaccessible environments. Among the challenges they pose, the way data travel among them is a relevant issue since their structure is quite dynamic. The operational topology of such devices can often be described by complex networks. In this work, we assess the variation of measures commonly employed in the complex networks literature applied to wireless sensor networks. Four data communication strategies were considered: geometric, random, small-world, and scale-free models, along with the shortest path length measure. The sensitivity of this measure was analyzed with respect to the following perturbations: insertion and removal of nodes in the geometric strategy; and insertion, removal and rewiring of links in the other models. The assessment was performed using the normalized Kullback-Leibler divergence and Hellinger distance quantifiers, both deriving from the Information Theory framework. The results reveal that the shortest path length is sensitive to perturbations.Comment: 12 pages, 4 figures, Central European Journal of Physic

More Insertion-Deletion Networks

This is the second of two articles that investigate various properties of the insertion-deletion (ID) networks. The first article appearing in the August 1990 Word Ways, looked at words fully deletable to 2-letter words, as well as words that can be deleted or inserted in every position (charitable and hospitable words). The complexity of the ID network was hinted at with a depiction of the insertion network of CARE

Communication Bottlenecks in Scale-Free Networks

We consider the effects of network topology on the optimality of packet routing quantified by $\gamma_c$, the rate of packet insertion beyond which congestion and queue growth occurs. The key result of this paper is to show that for any network, there exists an absolute upper bound, expressed in terms of vertex separators, for the scaling of $\gamma_c$ with network size $N$, irrespective of the routing algorithm used. We then derive an estimate to this upper bound for scale-free networks, and introduce a novel static routing protocol which is superior to shortest path routing under intense packet insertion rates.Comment: 5 pages, 3 figure

Modulating signaling networks by CRISPR/Cas9-mediated transposable element insertion

In a recent past, transposable elements (TEs) were referred to as selfish genetic components only capable of copying themselves with the aim of increasing the odds of being inherited. Nonetheless, TEs have been initially proposed as positive control elements acting in synergy with the host. Nowadays, it is well known that TE movement into host genome comprises an important evolutionary mechanism capable of increasing the adaptive fitness. As insights into TE functioning are increasing day to day, the manipulation of transposition has raised an interesting possibility of setting the host functions, although the lack of appropriate genome engineering tools has unpaved it. Fortunately, the emergence of genome editing technologies based on programmable nucleases, and especially the arrival of a multipurpose RNA-guided Cas9 endonuclease system, has made it possible to reconsider this challenge. For such purpose, a particular type of transposons referred to as miniature inverted-repeat transposable elements (MITEs) has shown a series of interesting characteristics for designing functional drivers. Here, recent insights into MITE elements and versatile RNA-guided CRISPR/Cas9 genome engineering system are given to understand how to deploy the potential of TEs for control of the host transcriptional activity.Fil: Vaschetto, Luis Maria Benjamin. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Córdoba. Instituto de Diversidad y Ecología Animal. Universidad Nacional de Córdoba. Facultad de Ciencias Exactas Físicas y Naturales. Instituto de Diversidad y Ecología Animal; Argentina. Universidad Nacional de Córdoba. Facultad de Ciencias Exactas, Físicas y Naturales. Cátedra de Diversidad Animal I; Argentin

Demonstration of efficient nonreciprocity in a microwave optomechanical circuit

The ability to engineer nonreciprocal interactions is an essential tool in modern communication technology as well as a powerful resource for building quantum networks. Aside from large reverse isolation, a nonreciprocal device suitable for applications must also have high efficiency (low insertion loss) and low output noise. Recent theoretical and experimental studies have shown that nonreciprocal behavior can be achieved in optomechanical systems, but performance in these last two attributes has been limited. Here we demonstrate an efficient, frequency-converting microwave isolator based on the optomechanical interactions between electromagnetic fields and a mechanically compliant vacuum gap capacitor. We achieve simultaneous reverse isolation of more than 20 dB and insertion loss less than 1.5 dB over a bandwidth of 5 kHz. We characterize the nonreciprocal noise performance of the device, observing that the residual thermal noise from the mechanical environments is routed solely to the input of the isolator. Our measurements show quantitative agreement with a general coupled-mode theory. Unlike conventional isolators and circulators, these compact nonreciprocal devices do not require a static magnetic field, and they allow for dynamic control of the direction of isolation. With these advantages, similar devices could enable programmable, high-efficiency connections between disparate nodes of quantum networks, even efficiently bridging the microwave and optical domains.Comment: 9 pages, 6 figure

Improving Energy Efficiency for IoT Communications in 5G Networks

Increase in number of Internet of Things (IoT) devices is quickly changing how mobile networks are being used by shifting more usage to uplink transmissions rather than downlink transmissions. Currently, mobile network uplinks utilize Single Carrier Frequency Division Multiple Access (SC-FDMA) schemes due to the low Peak to Average Power Ratio (PAPR) when compared to Orthogonal Frequency Division Multiple Access (OFDMA). In an IoT perspective, power ratios are highly important in effective battery usage since devices are typically resource-constrained. Fifth Generation (5G) mobile networks are believed to be the future standard network that will handle the influx of IoT device uplinks while preserving the quality of service (QoS) that current Long Term Evolution Advanced (LTE-A) networks provide. In this paper, the Enhanced OEA algorithm was proposed and simulations showed a reduction in the device energy consumption and an increase in the power efficiency of uplink transmissions while preserving the QoS rate provided with SC-FDMA in 5G networks. Furthermore, the computational complexity was reduced through insertion of a sorting step prior to resource allocation