Search NASA⌕ Search

SEARCH · Search NASA

Results for “sequence alignment”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 289 records · Page 16

Metatransciptomic Analysis Data for Interactive effects of depth and differential irrigation on soil microbiome composition and functioning

RNA was collected from soil at different depths and after three different levels of irrigation T1 100% of normal field irrigation, T4: 18.75% or normal irrigation and T5: unirrigated controls. Total RNA was isolated using the Zymo Quick-RNA fecal/soil microbe miniprep (catalog no. R2040), incorporating the DNase I treatment using Zymo’s DNase I kit (catalog no. E1010). To increase the yield of RNA, we modified the manufacturer’s instructions by first doubling the amount of soil per extraction (from 0.25 g to 0.5 g) and by performing extractions in triplicate before pooling separate extractions together. Certain soil samples (largely those from deeper soil layers) had low yield (< 100 ng per extraction) so additional rounds of extraction were performed to obtain sufficient RNA. RNA concentration was assessed using a Qubit RNA HS assay kit (Thermo Fisher) and RNA quality was determined using an Agilent 2100 BioAnalyzer (Agilent; Santa Clara, CA). The resultant RNA samples were then sequenced by GENEWIZ using Illumina technology (GENEWIZ; South Plainfield, NJ). Sequences were then aligned to a soil metagenome previously obtained from the same site using the Burrows-Wheeler aligner (BWA). SAM files were then converted to raw counts using HTSeq.

Soil microbiome, metatranscriptomics↗

RCSB Protein Data Bank: visualizing groups of experimentally determined PDB structures alongside computed structure models of proteins

Recent advances in Artificial Intelligence and Machine Learning (e.g., AlphaFold, RosettaFold, and ESMFold) enable prediction of three-dimensional (3D) protein structures from amino acid sequences alone at accuracies comparable to lower-resolution experimental methods. These tools have been employed to predict structures across entire proteomes and the results of large-scale metagenomic sequence studies, yielding an exponential increase in available biomolecular 3D structural information. Given the enormous volume of this newly computed biostructure data, there is an urgent need for robust tools to manage, search, cluster, and visualize large collections of structures. Equally important is the capability to efficiently summarize and visualize metadata, biological/biochemical annotations, and structural features, particularly when working with vast numbers of protein structures of both experimental origin from the Protein Data Bank (PDB) and computationally-predicted models. Moreover, researchers require advanced visualization techniques that support interactive exploration of multiple sequences and structural alignments. This paper introduces a suite of tools provided on the RCSB PDB research-focused web portal RCSB. org, tailor-made for efficient management, search, organization, and visualization of this burgeoning corpus of 3D macromolecular structure data.

3D visualization↗

Characterization of MtoD from Sideroxydans lithotrophicus : a cytochrome c electron shuttle used in lithoautotrophic growth

The autotrophic Sideroxydans lithotrophicus ES-1 can grow by coupling the oxidation of ferrous iron to the reduction of oxygen. Soluble ferrous iron is oxidized at the surface of the cell by an MtoAB porin-cytochrome complex that functions as an electron conduit through the outer membrane. Electrons are then transported to the cytoplasmic membrane where they are used to generate proton motive force (PMF) (for ATP synthesis) and NADH for autotrophic processes such as carbon fixation. As part of the mtoAB gene cluster, S. lithotrophicus also contains the gene mtoD that is proposed to encode a cytochrome c protein. We isolated mtoD from a Shewanella oneidensis expression system where the mtoD gene was expressed on a pBAD plasmid vector. Biochemical, biophysical, and crystallographic characterization of the purified MtoD revealed it as an 11 kDa monomeric protein containing a single heme. Sequence and structural alignment indicated that MtoD belonged to the class-1 cytochrome c family and had a similar fold to ferricytochrome c552 family, however the MtoD heme is bis-histidine coordinated and is substantially more exposed than the hemes of other family members. The reduction potential of the MtoD heme at pH 7 was +155 mV vs. Standard Hydrogen Electrode, which is approximately 100 mV lower than that of mitochondrial cytochrome c. Consideration of the properties of MtoD in the context of the potential respiratory partners identified from the genome suggests that MtoD could associate to multiple electron transfer partners as the primary periplasmic electron shuttle.

59 BASIC BIOLOGICAL SCIENCES↗

Fast Identification and Removal of Sequence Contamination from Genomic and Metagenomic Datasets

High-throughput sequencing technologies have strongly impacted microbiology, providing a rapid and cost-effective way of generating draft genomes and exploring microbial diversity. However, sequences obtained from impure nucleic acid preparations may contain DNA from sources other than the sample. Those sequence contaminations are a serious concern to the quality of the data used for downstream analysis, causing misassembly of sequence contigs and erroneous conclusions. Therefore, the removal of sequence contaminants is a necessary and required step for all sequencing projects. We developed DeconSeq, a robust framework for the rapid, automated identification and removal of sequence contamination in longer-read datasets (150 bp mean read length). DeconSeq is publicly available as standalone and web-based versions. The results can be exported for subsequent analysis, and the databases used for the web-based version are automatically updated on a regular basis. DeconSeq categorizes possible contamination sequences, eliminates redundant hits with higher similarity to non-contaminant genomes, and provides graphical visualizations of the alignment results and classifications. Using DeconSeq, we conducted an analysis of possible human DNA contamination in 202 previously published microbial and viral metagenomes and found possible contamination in 145 (72%) metagenomes with as high as 64% contaminating sequences. This new framework allows scientists to automatically detect and efficiently remove unwanted sequence contamination from their datasets while eliminating critical limitations of current methods. DeconSeq’s web interface is simple and user-friendly. The standalone version allows offline analysis and integration into existing data processing pipelines. DeconSeq’s results reveal whether the sequencing experiment has succeeded, whether the correct sample was sequenced, and whether the sample contains any sequence contamination from DNA preparation or host. In addition, the analysis of 202 metagenomes demonstrated significant contamination of the non-human associated metagenomes, suggesting that this method is appropriate for screening all metagenomes. DeconSeq is available at http://deconseq.sourceforge.net/.

59 BASIC BIOLOGICAL SCIENCES↗

Towards Scalable Optimal Sequence Homology Detection

Abstract—The field of bioinformatics and computational biol- ogy is experiencing a data revolution — experimental techniques to procure data have increased in throughput, improved in accuracy and reduced in costs. This has spurred an array of high profile sequencing and data generation projects. While the data repositories represent untapped reservoirs of rich information critical for scientific breakthroughs, the analytical software tools that are needed to analyze large volumes of such sequence data have significantly lagged behind in their capacity to scale. In this paper, we address homology detection, which is a funda- mental problem in large-scale sequence analysis with numerous applications. We present a scalable framework to conduct large- scale optimal homology detection on massively parallel super- computing platforms. Our approach employs distributed memory work stealing to effectively parallelize optimal pairwise alignment computation tasks. Results on 120,000 cores of the Hopper Cray XE6 supercomputer demonstrate strong scaling and up to 2.42 × 107 optimal pairwise sequence alignments computed per second (PSAPS), the highest reported in the literature.

Daily, Jeffrey A.↗

Structural Insights into Separase Architecture and Substrate Recognition through Computational Modelling of Caspase-Like and Death Domains

Separases are large proteins that mediate sister chromatid disjunction in all eukaryotes. They belong to clan CD of cysteine peptidases and contain a well-conserved C-terminal catalytic protease domain similar to caspases and gingipains. However, unlike other well-characterized groups of clan CD peptidases, there are no high-resolution structures of separases and the details of their regulation and substrate recognition are poorly understood. Here we undertook an in-depth bioinformatical analysis of separases from different species with respect to their similarity in amino acid sequence and protein fold in comparison to caspases, MALT-1 proteins (mucosa-associated lymphoidtissue lymphoma translocation protein 1) and gingipain-R. A comparative model of the single C-terminal caspase-like domain in separase from C. elegans suggests similar binding modes of substrate peptides between these protein subfamilies, and enables differences in substrate specificity of separase proteins to be rationalised. We also modelled a newly identified putative death domain, located N-terminal to the caspase-like domain. The surface features of this domain identify potential sites of protein-protein interactions. Notably, we identified a novel conserved region with the consensus sequence WWxxRxxLD predicted to be exposed on the surface of the death domain, which we termed the WR motif. We envisage that findings from our study will guide structural and functional studies of this important protein family.

59 BASIC BIOLOGICAL SCIENCES↗

FastTree: Computing Large Minimum Evolution Trees with Profiles instead of a Distance Matrix

Gene families are growing rapidly, but standard methods for inferring phylogenies do not scale to alignments with over 10,000 sequences. We present FastTree, a method for constructing large phylogenies and for estimating their reliability. Instead of storing a distance matrix, FastTree stores sequence profiles of internal nodes in the tree. FastTree uses these profiles to implement Neighbor-Joining and uses heuristics to quickly identify candidate joins. FastTree then uses nearest neighbor interchanges to reduce the length of the tree. For an alignment with N sequences, L sites, and a different characters, a distance matrix requires O(N2) space and O(N2L) time, but FastTree requires just O(NLa+N √N) memory and O(N √N log(N)La) time. To estimate the tree’s reliability, FastTree uses local bootstrapping, which gives another 100-fold speedup over a distance matrix. For example, FastTree computed a tree and support values for 158,022 distinct 16S ribosomal RNAs in 17 h and 2.4 GB of memory. Just computing pairwise Jukes–Cantor distances and storing them, without inferring a tree or bootstrapping, would require 17 h and 50 GB of memory. In simulations, FastTree was slightly more accurate than Neighbor-Joining, BIONJ, or FastME; on genuine alignments, FastTree’s topologies had higher likelihoods. FastTree is available at http://microbesonline.org/fasttree.

59 BASIC BIOLOGICAL SCIENCES↗

Fast Tree: Computing Large Minimum-Evolution Trees with Profiles instead of a Distance Matrix

Gene families are growing rapidly, but standard methods for inferring phylogenies do not scale to alignments with over 10,000 sequences. We present FastTree, a method for constructing large phylogenies and for estimating their reliability. Instead of storing a distance matrix, FastTree stores sequence profiles of internal nodes in the tree. FastTree uses these profiles to implement neighbor-joining and uses heuristics to quickly identify candidate joins. FastTree then uses nearest-neighbor interchanges to reduce the length of the tree. For an alignment with N sequences, L sites, and a different characters, a distance matrix requires O(N^2) space and O(N^2 L) time, but FastTree requires just O( NLa + N sqrt(N) ) memory and O( N sqrt(N) log(N) L a ) time. To estimate the tree's reliability, FastTree uses local bootstrapping, which gives another 100-fold speedup over a distance matrix. For example, FastTree computed a tree and support values for 158,022 distinct 16S ribosomal RNAs in 17 hours and 2.4 gigabytes of memory. Just computing pairwise Jukes-Cantor distances and storing them, without inferring a tree or bootstrapping, would require 17 hours and 50 gigabytes of memory. In simulations, FastTree was slightly more accurate than neighbor joining, BIONJ, or FastME; on genuine alignments, FastTree's topologies had higher likelihoods. FastTree is available at http://microbesonline.org/fasttree.

42 ENGINEERING↗

Use of 16S rRNA gene for identification of a broad range of clinically relevant bacterial pathogens

According to World Health Organization statistics of 2011, infectious diseases remain in the top five causes of mortality worldwide. However, despite sophisticated research tools for microbial detection, rapid and accurate molecular diagnostics for identification of infection in humans have not been extensively adopted. Time-consuming culture-based methods remain to the forefront of clinical microbial detection. The 16S rRNA gene, a molecular marker for identification of bacterial species, is ubiquitous to members of this domain and, thanks to ever-expanding databases of sequence information, a useful tool for bacterial identification. In this study, we assembled an extensive repository of clinical isolates (n = 617), representing 30 medically important pathogenic species and originally identified using traditional culture-based or non-16S molecular methods. This strain repository was used to systematically evaluate the ability of 16S rRNA for species level identification. To enable the most accurate species level classification based on the paucity of sequence data accumulated in public databases, we built a Naïve Bayes classifier representing a diverse set of high-quality sequences from medically important bacterial organisms. We show that for species identification, a model-based approach is superior to an alignment based method. Overall, between 16S gene based and clinical identities, our study shows a genus-level concordance rate of 96% and a species-level concordance rate of 87.5%. We point to multiple cases of probable clinical misidentification with traditional culture based identification across a wide range of gram-negative rods and gram-positive cocci as well as common gram-negative cocci.

60 APPLIED LIFE SCIENCES↗

Alignment of asymmetric-top molecules using multiple-pulse trains

We theoretically analyze the effectiveness of multiple-pulse laser alignment methods for asymmetric-top molecules. As an example, we choose SO{sub 2} and investigate the alignment dynamics induced by two different sequences, each consisting of four identical laser pulses. Each sequence differs only in the time delay between the pulses. Equally spaced pulses matching the alignment revival of the symmetrized SO{sub 2} rotor model are exploited in the first sequence. The pulse separations in the second sequence are short compared to the rotation dynamics of the molecule and monotonically increase the degree of alignment until the maximum alignment is reached. We point out the significant differences between the alignment dynamics of SO{sub 2} treated as an asymmetric-top and a symmetric-top rotor, respectively. We also explain why the fast sequence of laser pulses creates considerably stronger one-dimensional molecular alignment for asymmetric-top molecules. In addition, we show that multiple-pulse trains with elliptically polarized pulses do not enhance one-dimensional alignment or create three-dimensional alignment.

74 ATOMIC AND MOLECULAR PHYSICS↗

Comprehensive Genetic Characterization of Four Novel HIV-1 Circulating Recombinant Forms (CRF129_56G, CRF130_A1B, CRF131_A1B, and CRF138_cpx): Insights from Molecular Epidemiology in Cyprus

Molecular investigations of the HIV-1 pol region (2253–5250 in the HXB2 genome) were conducted on sequences obtained from 331 individuals infected with HIV-1 in Cyprus between 2017 and 2021. This study unveiled four distinct HIV-1 putative transmission clusters, encompassing 19 previously unidentified HIV-1 recombinants. These recombinants, each comprising eight, three, four, and four sequences, respectively, did not align with previously established Circulating Recombinant Forms (CRFs). To characterize these novel HIV-1 recombinants, near-full-length genome sequences were successfully obtained for 16 of the 19 recombinants (790–8795 in the HXB2 genome) using an in-house-developed RT-PCR assay. Phylogenetic analyses, employing MEGAX and Cluster-Picker, along with confirmatory neighbor-joining tree analyses of subregions, were conducted to identify distinct clusters and determine subtypes. The uniqueness of the HIV-1 recombinants was evident in their exclusive clustering within generated maximum likelihood trees. Recombination analyses highlighted the distinct chimeric nature of these recombinants, with consistent mosaic patterns observed across all sequences within each of the four putative transmission clusters. Conclusive genetic characterization identified four novel HIV-1 CRFs: CRF129_56G, CRF130_A1B, CRF131_A1B, and CRF138_cpx. CRF129_56G exhibited two recombination breakpoints and three fragments of subtypes CRF56_cpx and G. Both CRF130_A1B and CRF131_A1B featured seven recombination breakpoints and eight fragments of subtypes A1 and B. CRF138_cpx displayed five recombination breakpoints and six fragments of subtypes CRF22_01A1 and F2, along with an unclassified fragment. Additional BLAST analyses identified a Unique Recombinant Form (URF) of CRF138_cpx with three additional recombination sites, involving subtype F2, a fragment of unknown subtype origin, and CRF138_cpx. Post-identification, all putative transmission clusters remained active, with CRF130_A1B, CRF131_A1B, and CRF138_cpx clusters exhibiting further growth. Furthermore, international connections were identified through BLAST analyses, linking one sequence from the USA to the CRF130_A1B strain, and three sequences from Belgium and Cameroon to the CRF138_cpx strain. This study contributes valuable insights into the dynamic landscape of HIV-1 diversity and transmission patterns, emphasizing the need for ongoing molecular surveillance and global collaboration in tracking emerging viral variants.

60 APPLIED LIFE SCIENCES↗

FastBLAST: Homology Relationships for Millions of Proteins

Background: All-versus-all BLAST, which searches for homologous pairs of sequences in a database of proteins, is used to identify potential orthologs, to find new protein families, and to provide rapid access to these homology relationships. As DNA sequencing accelerates and data sets grow, all-versus-all BLAST has become computationally demanding. Methodology/Principal Findings: We present FastBLAST, a heuristic replacement for all-versus-all BLAST that relies on alignments of proteins to known families, obtained from tools such as PSI-BLAST and HMMer. FastBLAST avoids most of the work of all-versus-all BLAST by taking advantage of these alignments and by clustering similar sequences. FastBLAST runs in two stages: the first stage identifies additional families and aligns them, and the second stage quickly identifies the homologs of a query sequence, based on the alignments of the families, before generating pairwise alignments. On 6.53 million proteins from the non-redundant Genbank database (‘‘NR’’), FastBLAST identifies new families 25 times faster than all-versus-all BLAST. Once the first stage is completed, FastBLAST identifies homologs for the average query in less than 5 seconds (8.6 times faster than BLAST) and gives nearly identical results. For hits above 70 bits, FastBLAST identifies 98% of the top 3,250 hits per query. Conclusions/Significance: FastBLAST enables research groups that do not have supercomputers to analyze large protein sequence data sets. FastBLAST is open source software and is available at http://microbesonline.org/fastblast.

59 BASIC BIOLOGICAL SCIENCES↗

Supersplat--spliced RNA-seq alignment

Motivation: High-throughput sequencing technologies have recently made deep interrogation of expressed transcript sequences practical, both economically and temporally. Identification of intron/exon boundaries is an essential part of genome annotation, yet remains a challenge. Here, we present supersplat, a method for unbiased splice-junction discovery through empirical RNA-seq data. Results: Using a genomic reference and RNA-seq high-throughput sequencing datasets, supersplat empirically identifies potential splice junctions at a rate of ~11.4 million reads per hour. We further benchmark the performance of the algorithm by mapping Illumina RNA-seq reads to identify introns in the genome of the reference dicot plant Arabidopsis thaliana and we demonstrate the utility of supersplat for de novo empirical annotation of splice junctions using the reference monocot plant Brachypodium distachyon. Availability: Implemented in C++, supersplat source code and binaries are freely available on the web at http://mocklerlabtools.cgrb.oregonstate.edu/

59 BASIC BIOLOGICAL SCIENCES↗

NoFold: RNA structure clustering without folding or alignment

Structures that recur across multiple different transcripts, called structure motifs, often perform a similar function—for example, recruiting a specific RNA-binding protein that then regulates translation, splicing, or subcellular localization. Identifying common motifs between coregulated transcripts may therefore yield significant insight into their binding partners and mechanism of regulation. However, as most methods for clustering structures are based on folding individual sequences or doing many pairwise alignments, this results in a tradeoff between speed and accuracy that can be problematic for large-scale data sets. Here we describe a novel method for comparing and characterizing RNA secondary structures that does not require folding or pairwise alignment of the input sequences. Our method uses the idea of constructing a distance function between two objects by their respective distances to a collection of empirical examples or models, which in our case consists of 1973 Rfam family covariance models. Using this as a basis for measuring structural similarity, we developed a clustering pipeline called NoFold to automatically identify and annotate structure motifs within large sequence data sets. We demonstrate that NoFold can simultaneously identify multiple structure motifs with an average sensitivity of 0.80 and precision of 0.98 and generally exceeds the performance of existing methods. We also perform a cross-validation analysis of the entire set of Rfam families, achieving an average sensitivity of 0.57. We apply NoFold to identify motifs enriched in dendritically localized transcripts and report 213 enriched motifs, including both known and novel structures.

59 BASIC BIOLOGICAL SCIENCES↗

Rapid Threat Organism Recognition Pipeline

The RAPTOR computational pipeline identifies microbial nucleic acid sequences present in sequence data from clinical samples. It takes as input raw short-read genomic sequence data (in particular, the type generated by the Illumina sequencing platforms) and outputs taxonomic evaluation of detected microbes in various human-readable formats. This software was designed to assist in the diagnosis or characterization of infectious disease, by detecting pathogen sequences in nucleic acid sequence data from clinical samples. It has also been applied in the detection of algal pathogens, when algal biofuel ponds became unproductive. RAPTOR first trims and filters genomic sequence reads based on quality and related considerations, then performs a quick alignment to the human (or other host) genome to filter out host sequences, then performs a deeper search against microbial genomes. Alignment to a protein sequence database is optional. Alignment results are summarized and placed in a taxonomic framework using the Lowest Common Ancestor algorithm.

Solberg, OwenD.↗

Rapid Threat Organism Recognition Pipeline

The RAPTOR computational pipeline identifies microbial nucleic acid sequences present in sequence data from clinical samples. It takes as input raw short-read genomic sequence data (in particular, the type generated by the Illumina sequencing platforms) and outputs taxonomic evaluation of detected microbes in various human-readable formats. This software was designed to assist in the diagnosis or characterization of infectious disease, by detecting pathogen sequences in nucleic acid sequence data from clinical samples. It has also been applied in the detection of algal pathogens, when algal biofuel ponds became unproductive. RAPTOR first trims and filters genomic sequence reads based on quality and related considerations, then performs a quick alignment to the human (or other host) genome to filter out host sequences, then performs a deeper search against microbial genomes. Alignment to a protein sequence database is optional. Alignment results are summarized and placed in a taxonomic framework using the Lowest Common Ancestor algorithm.

Williams, Kelly P.↗

Pipelining RDP Data to the "Taxomatic" (Final Report)

This project builds on the results of previously funded research by integrating data and software that had been previously used in building resources used in the preparation of Bergey's Manual of Systematic Bacteriology, 2 nd Edition (Volumes 1 & 2A-C) and the Ribosomal Database Project-II (RDP-II) so as to both enhance the value of the data and create a pipeline approach to keeping the data current. Earlier, we demonstrated the value of using exploratory data analysis (EDA) to visualize large sets of sequence data (notably SSU rRNA gene sequences used in constructing a comprehensive phylogeny of prokaryotes. While the Self- Organizing Self-Correcting Classification (SOSCC) algorithms we developed were computationally efficient and useful for unraveling problems within the underlying data (e.g., identification of annotation errors, detection of unresolved synonymies, taxonomic and nomenclatural errors), bottlenecks at the preprocessing stage limited deployment of our applications as tools for end-users. To overcome the bottlenecks (which included hand alignment and computation of large matrices of pair-wise evolutionary distances), we proposed building a data pipeline between the "Taxomatic" application and RDP-II. The objectives were to accelerate the production and distribution of the updated versions of the prokaryotic taxonomy in lock-step with publication of new taxa and rearrangement of existing taxa, and to distribute these data more readily with the RDP-II and and other stakeholders in the community. A related goal of the current project is to deploy our visualization techniques as an interactive web application by which end-users can view manipulate, and select datasets of particular interest based upon phylogenetic and genomic information, access sequence data, and ultimately the scientific literature where the original observations were made and those that build on the original observations. The Taxomatic is a web-based tool to visualize distance matrices. The tool accepts raw distance matrices or aligned sequence information as data sources. When sequence information is provided the distance matrix is computed using the uncorrected distance model. Users can upload files to the Taxomatic website or sequences can be submitted by a SOAP service. This SOAP service is used by RDP to streamline Taxomatic use with RDP data. In addition to supplying source information, users can either supply their own taxonomic information by uploading it in XML, retrieve data taxonomic information from the RDP using either RDP or Genbank identifiers as source data, with or without classification by the RDP Classifier web service, or completely omit taxonomic data. In the latter case, the input distance matrix can be viewed in the order in which it was loaded.

59 BASIC BIOLOGICAL SCIENCES↗

PilF Is an Outer Membrane Lipoprotein Required for Multimerization and Localization of the Pseudomonas aeruginosa Type IV Pilus Secretin

Type IV pili (T4P) are retractile appendages that contribute to the virulence of bacterial pathogens. PilF is a Pseudomonas aeruginosa lipoprotein that is essential for T4P biogenesis. Phenotypic characterization of a pilF mutant confirmed that T4P-mediated functions are abrogated: T4P were no longer present on the cell surface, twitching motility was abolished, and the mutant was resistant to infection by T4P retraction-dependent bacteriophage. The results of cellular fractionation studies indicated that PilF is the outer membrane pilotin required for the localization and multimerization of the secretin, PilQ. Mutation of the putative PilF lipidation site untethered the protein from the outer membrane, causing secretin assembly in both inner and outer membranes. T4P-mediated twitching motility and bacteriophage susceptibility were moderately decreased in the lipidation site mutant, while cell surface piliation was substantially reduced. The tethering of PilF to the outer membrane promotes the correct localization of PilQ and appears to be required for the formation of stable T4P. Our 2.0-A structure of PilF revealed a superhelical arrangement of six tetratricopeptide protein-protein interaction motifs that may mediate the contacts with PilQ during secretin assembly. An alignment of pseudomonad PilF sequences revealed three highly conserved surfaces that may be involved in PilF function.

59 BASIC BIOLOGICAL SCIENCES↗