Alignments for a candidate for nupA in Moritella dasanensis ArB 0140

GapMind for catabolism of small carbon sources

Alignments for a candidate for nupA in Moritella dasanensis ArB 0140

Align Purine/cytidine ABC transporter ATP-binding protein, component of General nucleoside uptake porter, NupABC/BmpA (transports all common nucleosides as well as 5-fluorocytidine, inosine, deoxyuridine and xanthosine) (Martinussen et al., 2010) (Most similar to 3.A.1.2.12). NupA is 506aas with two ABC (C) domains. NupB has 8 predicted TMSs, NupC has 9 or 10 predicted TMSs in a 4 + 1 (or 2) + 4 arrangement (characterized)
to candidate WP_017221119.1 A923_RS0107850 ribose ABC transporter ATP-binding protein RbsA

Query= TCDB::A2RKA7
         (506 letters)



>NCBI__GCF_000276805.1:WP_017221119.1
          Length = 501

 Score =  290 bits (742), Expect = 8e-83
 Identities = 175/506 (34%), Positives = 281/506 (55%), Gaps = 13/506 (2%)

Query: 4   ETVIQMIDVTKRFGDFVANDKVNLELKKGEIHALLGENGAGKSTLMNILSGLLEPSEGEV 63
           + ++++  + K F    A D   L +  G++ ALLGENGAGKSTLM +L+G+    +G +
Sbjct: 3   QAILKLSGIEKSFPGVKALDNACLNVYPGKVMALLGENGAGKSTLMKVLTGIYHMDKGSI 62

Query: 64  HVKGKLENIDSPSKAANLGIGMVHQHFMLVDAFTVTENIILGNEVTK---GINLDLKTAK 120
           + +G     D P  +  +GI ++HQ   L+   T+ ENI LG E T    GI      A 
Sbjct: 63  NYQGSDVTFDGPRHSQEVGISIIHQELNLIPELTIAENIYLGRETTNAFGGIKWTQMFAD 122

Query: 121 KKILELSERYGLSVEPDALIRDISVGQQQRVEILKTLYRGADILIFDEPTAVLTPAEITE 180
              L   +R  +      L+ ++S+G+QQ VEI K L   + +++ DEPT  LT +E   
Sbjct: 123 ADAL--LQRLNVKHSSRQLLGELSLGEQQMVEIAKALSFKSQVIVMDEPTDALTESETKS 180

Query: 181 LMQIMKNLIKEGKSIILITHKLDEIRAVADRITVIRRGKSIDTVELGDKTNQELAELMVG 240
           L +++  L  EG  I+ I+H+L EI  + D ITV+R GK I  + + D     L E MVG
Sbjct: 181 LFKVINELRNEGCGIVYISHRLKEIFEICDDITVLRDGKFIAEIAVTDIDEDGLIEKMVG 240

Query: 241 RSVSFITEKAAAQPKDVVLEIKDLNIKESRGSLKVKGLSLDVRAGEIVGVAGIDGNGQTE 300
           R +  I  +  A+   + LE++++          V+ +S  +  GEI+G++G+ G G+TE
Sbjct: 241 RRLDEIYPRIDAKHGTLCLEVENIVAPG------VRDVSFTLDHGEILGISGLMGAGRTE 294

Query: 301 LVKAITGLTKVDSGSIKLHNKDITNQRPRKITEQSVGHVPEDRHRDGLVLEMTVAENIAL 360
           L+KAI G     SG + L +K ++   PR      + ++ EDR  DGL+L ++V EN++L
Sbjct: 295 LMKAIYGALPRQSGDVILDDKVVSPITPRDGLANGIAYISEDRKGDGLILGLSVKENMSL 354

Query: 361 QTYYKPPMSKYGFLDYNKINSHARELMEEFDVRGAGEWVSASSLSGGNQQKAIIAREIDR 420
                  +SK   LD+ K  +   + M +F+V+         +LSGGNQQK  IA+ +  
Sbjct: 355 CAL--DALSKGLQLDHAKEATAVEDFMRQFNVKTPSRDQIIGNLSGGNQQKVAIAKGLMT 412

Query: 421 NPDLLIVSQPTRGLDVGAIEYIHKRLIQARDEGKAVLVISFELDEILNVSDRIAVIHDGQ 480
            P +LI+ +PTRG+DVGA + I++ + Q + EG +++++S E+ E+L +SDRI V+H+G+
Sbjct: 413 RPKVLILDEPTRGVDVGAKKEIYQLINQFKAEGMSIILVSSEMPEVLGMSDRILVMHEGR 472

Query: 481 IQGIVSPETTTKQELGILMVGGNINE 506
           I G        +++L    VG  INE
Sbjct: 473 ISGEFMAADANQEKLMACAVGKKINE 498


Lambda     K      H
   0.315    0.135    0.365 

Gapped
Lambda     K      H
   0.267   0.0410    0.140 


Matrix: BLOSUM62
Gap Penalties: Existence: 11, Extension: 1
Number of Sequences: 1
Number of Hits to DB: 641
Number of extensions: 35
Number of successful extensions: 8
Number of sequences better than 1.0e-02: 1
Number of HSP's gapped: 1
Number of HSP's successfully gapped: 1
Length of query: 506
Length of database: 501
Length adjustment: 34
Effective length of query: 472
Effective length of database: 467
Effective search space:   220424
Effective search space used:   220424
Neighboring words threshold: 11
Window for multiple hits: 40
X1: 16 ( 7.3 bits)
X2: 38 (14.6 bits)
X3: 64 (24.7 bits)
S1: 42 (22.0 bits)
S2: 52 (24.6 bits)

This GapMind analysis is from Sep 24 2021. The underlying query database was built on Sep 17 2021.

Downloads

Candidates (tab-delimited)
Steps (tab-delimited)
Rules (tab-delimited)
Protein sequences (fasta format)
Organisms (tab-delimited)
SQLite3 databases

Related tools

About GapMind

Each pathway is defined by a set of rules based on individual steps or genes. Candidates for each step are identified by using ublast (a fast alternative to protein BLAST) against a database of manually-curated proteins (most of which are experimentally characterized) or by using HMMer with enzyme models (usually from TIGRFam). Ublast hits may be split across two different proteins.

A candidate for a step is "high confidence" if either:

ublast finds a hit to a characterized protein at above 40% identity and 80% coverage, and bits >= other bits+10.
- (Hits to curated proteins without experimental data as to their function are never considered high confidence.)
HMMer finds a hit with 80% coverage of the model, and either other identity < 40 or other coverage < 0.75.

where "other" refers to the best ublast hit to a sequence that is not annotated as performing this step (and is not "ignored").

Otherwise, a candidate is "medium confidence" if either:

ublast finds a hit at above 40% identity and 70% coverage (ignoring otherBits).
ublast finds a hit at above 30% identity and 80% coverage, and bits >= other bits.
HMMer finds a hit (regardless of coverage or other bits).

Other blast hits with at least 50% coverage are "low confidence."

Steps with no high- or medium-confidence candidates may be considered "gaps." For the typical bacterium that can make all 20 amino acids, there are 1-2 gaps in amino acid biosynthesis pathways. For diverse bacteria and archaea that can utilize a carbon source, there is a complete high-confidence catabolic pathway (including a transporter) just 38% of the time, and there is a complete medium-confidence pathway 63% of the time. Gaps may be due to:

our ignorance of proteins' functions,
omissions in the gene models,
frame-shift errors in the genome sequence, or
the organism lacks the pathway.

GapMind relies on the predicted proteins in the genome and does not search the six-frame translation. In most cases, you can search the six-frame translation by clicking on links to Curated BLAST for each step definition (in the per-step page).

For more information, see:

the paper from 2019 on GapMind for amino acid biosynthesis
the 2024 update on GapMind for amino acid biosynthesis
the paper from 2022 on GapMind for carbon sources
the source code
instructions for running GapMind on your computer

If you notice any errors or omissions in the step descriptions, or any questionable results, please let us know

by Morgan Price, Arkin group, Lawrence Berkeley National Laboratory

GapMind for catabolism of small carbon sources