scholarly journals Distribution of genome rearrangement distance under double cut and join

2014 ◽  
Vol 7 (4) ◽  
pp. 491-507
Author(s):  
Jacqueline Christy ◽  
Joshua McHugh ◽  
Manda Riehl ◽  
Noah Williams

Author(s):  
Richard Friedberg ◽  
Aaron E. Darling ◽  
Sophia Yancopoulos


BMC Genomics ◽  
2021 ◽  
Vol 22 (1) ◽  
Author(s):  
Yong Guo ◽  
Tomo Aoyagi ◽  
Tomoyuki Hori

Abstract Background Halotolerant Fe (III) oxide reducers affiliated in the family Desulfuromonadaceae are ubiquitous and drive the carbon, nitrogen, sulfur and metal cycles in marine subsurface sediment. Due to their possible application in bioremediation and bioelectrochemical engineering, some of phylogenetically close Desulfuromonas spp. strains have been isolated through enrichment with crystalline Fe (III) oxide and anode. The strains isolated using electron acceptors with distinct redox potentials may have different abilities, for instance, of extracellular electron transport, surface recognition and colonization. The objective of this study was to identify the different genomic signatures between the crystalline Fe (III) oxide-stimulated strain AOP6 and the anode-stimulated strains WTL and DDH964 by comparative genome analysis. Results The AOP6 genome possessed the flagellar biosynthesis gene cluster, as well as diverse and abundant genes involved in chemotaxis sensory systems and c-type cytochromes capable of reduction of electron acceptors with low redox potentials. The WTL and DDH964 genomes lacked the flagellar biosynthesis cluster and exhibited a massive expansion of transposable gene elements that might mediate genome rearrangement, while they were deficient in some of the chemotaxis and cytochrome genes and included the genes for oxygen resistance. Conclusions Our results revealed the genomic signatures distinctive for the ferric iron oxide- and anode-stimulated Desulfuromonas spp. strains. These findings highlighted the different metabolic abilities, such as extracellular electron transfer and environmental stress resistance, of these phylogenetically close bacterial strains, casting light on genome evolution of the subsurface Fe (III) oxide reducers.





Author(s):  
Lung Lu Chin ◽  
Chih Lin Ying ◽  
Lin Huang Yen ◽  
Yi Tang Chuan
Keyword(s):  


2017 ◽  
Vol 18 (S12) ◽  
Author(s):  
Ghada H. Badr ◽  
Haifa A. Al-aqel




eLife ◽  
2015 ◽  
Vol 4 ◽  
Author(s):  
André Plagens ◽  
Michael Daume ◽  
Julia Wiegel ◽  
Lennart Randau

Signal recognition particles (SRPs) are universal ribonucleoprotein complexes found in all three domains of life that direct the cellular traffic and secretion of proteins. These complexes consist of SRP proteins and a single, highly structured SRP RNA. Canonical SRP RNA genes have not been identified for some Thermoproteus species even though they contain SRP19 and SRP54 proteins. Here, we show that genome rearrangement events in Thermoproteus tenax created a permuted SRP RNA gene. The 5'- and 3'-termini of this SRP RNA are located close to a functionally important loop present in all known SRP RNAs. RNA-Seq analyses revealed that these termini are ligated together to generate circular SRP RNA molecules that can bind to SRP19 and SRP54. The circularization site is processed by the tRNA splicing endonuclease. This moonlighting activity of the tRNA splicing machinery permits the permutation of the SRP RNA and creates highly stable and functional circular RNA molecules.



10.37236/1947 ◽  
2005 ◽  
Vol 12 (1) ◽  
Author(s):  
Avraham Goldstein ◽  
Petr Kolman ◽  
Jie Zheng

String comparison is a fundamental problem in computer science, with applications in areas such as computational biology, text processing and compression. In this paper we address the minimum common string partition problem, a string comparison problem with tight connection to the problem of sorting by reversals with duplicates, a key problem in genome rearrangement. A partition of a string $A$ is a sequence ${\cal P} = (P_1,P_2,\dots,P_m)$ of strings, called the blocks, whose concatenation is equal to $A$. Given a partition ${\cal P}$ of a string $A$ and a partition ${\cal Q}$ of a string $B$, we say that the pair $\langle{{\cal P},{\cal Q}}\rangle$ is a common partition of $A$ and $B$ if ${\cal Q}$ is a permutation of ${\cal P}$. The minimum common string partition problem (MCSP) is to find a common partition of two strings $A$ and $B$ with the minimum number of blocks. The restricted version of MCSP where each letter occurs at most $k$ times in each input string, is denoted by $k$-MCSP. In this paper, we show that $2$-MCSP (and therefore MCSP) is NP-hard and, moreover, even APX-hard. We describe a $1.1037$-approximation for $2$-MCSP and a linear time $4$-approximation algorithm for $3$-MCSP. We are not aware of any better approximations.



1984 ◽  
Vol 26 (S8B) ◽  
pp. 119-164
Keyword(s):  


Sign in / Sign up

Export Citation Format

Share Document