bioRxiv ScienceSearch

Biology subjects

Spohr, P.

Publications and source records attributed to Spohr, P..

2 recordsLinked to original sources

Rhizobiales commensal bacteria promote Arabidopsis thaliana root growth via host sulfated peptide pathway

Root-associated commensal bacteria that belong to the order Rhizobiales, which also contains symbiotic and pathogenic bacteria, promote primary root growth of Arabidopsis thaliana. However, the molecular mechanism underlying this root growth promotion (RGP) activity remained unclear. Here, we conducted a transcriptomic analysis of A. thaliana roots inoculated with root-associated commensal bacteria of Rhizobiales and sister lineages and revealed common and strain/lineage-specific transcriptional response, possibly mediated by WRKY and ANAC family of transcription factors. We showed that the observed common response was also partly triggered by a wide range of non-pathogenic bacteria, fungi, and a multikingdom synthetic community (SynCom). This response was characterized by a down-regulation of genes related to intracellular redox regulation, suggesting distinctive redox status between pathogenic and non-pathogenic interactions. By integrating with developmental and cell biological experiments, we identified a crucial role of TYROSYLPROTEIN SULFOTRANSFERASE (TPST) in Rhizobiales RGP. Conversely, none of the known TPST-dependent sulfated peptide pathways appeared to be required for this activity, suggesting an unidentified component in the protein sulfation pathway targeted by Rhizobiales RGP. Finally, we show that TPST is needed for RGP exerted by Rhizobiales but not Pseudomonadales isolates, delineating lineage-specific mechanisms to manipulate host root development.

plant biology

The Homo-Edit Distance Problem

We consider the homo-edit distance problem, which is the minimum number of homo-deletions or homo-insertions to convert one string into another. A homo-insertion is the insertion of a string of equal characters into another string, while a homo-deletion is the inverse operation. We show how to compute the homo-edit distance of two strings in polynomial time: We first demonstrate that the problem is equivalent to computing a common subsequence of the two input strings with a minimum number of homo-deletions and then present a dynamic programming solution for the reformulated problem. 2012 ACM Subject ClassificationApplied computing [->] Bioinformatics; Applied computing [->] Molecular sequence analysis; Theory of computation [->] Dynamic programming

bioinformatics