GapMind for catabolism of small carbon sources

 

Alignments for a candidate for glcV in Alicycliphilus denitrificans K601

Align monosaccharide-transporting ATPase (EC 3.6.3.17) (characterized)
to candidate WP_013517832.1 ALIDE2_RS04530 sn-glycerol-3-phosphate ABC transporter ATP-binding protein UgpC

Query= BRENDA::Q97UY8
         (353 letters)



>NCBI__GCF_000204645.1:WP_013517832.1
          Length = 335

 Score =  218 bits (555), Expect = 2e-61
 Identities = 135/355 (38%), Positives = 203/355 (57%), Gaps = 33/355 (9%)

Query: 1   MVRIIVKNVSKVFKKGK--VVALDNVNINIENGERFGILGPSGAGKTTFMRIIAGLDVPS 58
           M  I +KN+ K +  GK  V  +  VN  I++GE   ++GPSG GK+T +R+IAGL+  +
Sbjct: 1   MASISLKNIVKRYGSGKSAVPVIHGVNAEIKDGEFIVLVGPSGCGKSTLLRMIAGLEEIT 60

Query: 59  TGELYFDDRLVASNGKLIVPPEDRKIGMVFQTWALYPNLTAFENIAFPLTNMKMSKEEIR 118
            GEL+  DRLV  NG   + P  R I MVFQ +ALYP++T FEN+A+ L   K+ K+EIR
Sbjct: 61  GGELFIGDRLV--NG---LEPARRNIAMVFQNYALYPHMTNFENMAYGLKLAKVPKDEIR 115

Query: 119 KRVEEVAKILDIHHVLNHFPRELSGGQQQRVALARALVKDPSLLLLDEPFSNLDARMRDS 178
           +RV++ AKIL++ H+L   PRELSGGQ+QRVA+ RA+V++P + L DEP SNLDA++R  
Sbjct: 116 RRVDKAAKILELSHLLERKPRELSGGQRQRVAMGRAIVREPQVFLFDEPLSNLDAKLRGQ 175

Query: 179 ARALVKEVQSRLGVTLLVVSHDPADIFAIADRVGVLVKGKLVQVGKPEDLYDNPVSIQVA 238
            R  ++++ + LG+T L V+HD  +   +A R+ V+  G + Q G PE++Y  P +  VA
Sbjct: 176 TRIEIQKLHTELGITSLFVTHDQVEAMTLAQRMIVMNAGNVEQFGTPEEVYHEPATTFVA 235

Query: 239 SLIGE--INELEGKVTNEGVVIGSLRFPVSVSSDRAIIGIRPEDVKLSKDVIKDDSWILV 296
           S IG   +N L+                        I+GIRPE +    D+++   W   
Sbjct: 236 SFIGSPPMNLLK---------------QAPGGQPGRILGIRPEHI----DLVESGGW--- 273

Query: 297 GKGKVKVIGYQGGLFRITITPLDSEEEIFTYSDHPI-HSGEEVLVYVRKDKIKVF 350
            + KV+ +   G    +     D +  + T  D P    GE   +  R+D++  F
Sbjct: 274 -EFKVETLELLGAERLLYGKVGDEDLTVRTEEDKPYPKPGETTRIAPRRDRVHWF 327


Lambda     K      H
   0.319    0.139    0.390 

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: 290
Number of extensions: 18
Number of successful extensions: 2
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: 353
Length of database: 335
Length adjustment: 29
Effective length of query: 324
Effective length of database: 306
Effective search space:    99144
Effective search space used:    99144
Neighboring words threshold: 11
Window for multiple hits: 40
X1: 16 ( 7.4 bits)
X2: 38 (14.6 bits)
X3: 64 (24.7 bits)
S1: 41 (21.7 bits)
S2: 49 (23.5 bits)

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

Links

Downloads

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:

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:

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:

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:

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