GapMind for catabolism of small carbon sources

 

Alignments for a candidate for aglK in Pseudovibrio axinellae Ad2

Align ABC transporter for D-Maltose and D-Trehalose, ATPase component (characterized)
to candidate WP_068002943.1 PsAD2_RS04510 ABC transporter ATP-binding protein

Query= reanno::Smeli:SMc03065
         (362 letters)



>NCBI__GCF_001623255.1:WP_068002943.1
          Length = 363

 Score =  293 bits (751), Expect = 4e-84
 Identities = 165/360 (45%), Positives = 229/360 (63%), Gaps = 9/360 (2%)

Query: 1   MTGLLLKDIRKSYGAVDVIHGIDLDIKEGEFVVFVGPSGCGKSTLLRMIAGLEEITGGDM 60
           M  + L+++ K YG  +V+HGI+L+++E EF VFVGPSGCGK+T LRMIAGLE ++ G++
Sbjct: 1   MPRIRLENLVKRYGDFEVLHGINLEMEENEFTVFVGPSGCGKTTTLRMIAGLETVSDGEI 60

Query: 61  FIDGERVNDVPPSKRGIAMVFQSYALYPHMTVYDNMAFGMRIARESKEEIDRRVRGAADM 120
           +I    V+ + P  R +AMVFQ YALYPHM V  NM+F +R+ R  ++EID +V   A+M
Sbjct: 61  YIGDRPVSQLEPKARDLAMVFQDYALYPHMNVAKNMSFALRLQRRPRKEIDEKVGLVAEM 120

Query: 121 LQLTPYLDRLPKALSGGQRQRVAIGRAICRNPKVFLFDEPLSNLDAALRVATRIEIAKLS 180
           L LT +L R P  LSGGQRQRVA+GRA+ R+   FLFDEPLSNLDA LR   R E+A + 
Sbjct: 121 LGLTKFLHRKPGELSGGQRQRVAMGRALARDAGTFLFDEPLSNLDAKLRCQMRAELAIMR 180

Query: 181 ERMSDTTMIYVTHDQVEAMTLADRIVVLSAGHIEQVGAPLELYERPANLFVARFIGSPAM 240
           +++    MIYVTHDQ+EAMTL DRIVV++ G+I+Q G P EL+++PAN FVA F+GSP M
Sbjct: 181 QKVR-KNMIYVTHDQIEAMTLGDRIVVMNGGYIQQQGTPEELFKQPANKFVAGFLGSPPM 239

Query: 241 NVIPATITATGQQTAVSLAGGKSVTLDVPTNASENGKTAS---FGVRPEDLRVT--EADD 295
           N + A I   G Q  VS   G  V L     +   G +AS    G+RP DL  +    D 
Sbjct: 240 NFLGAKIQDLGGQVFVS-GDGFEVALPEERASVALGHSASSVILGIRPSDLHFSPHAPDH 298

Query: 296 FLFEGTVSIVEALGEVTLLYIEGLVENEPIIAKMPGIARVGRGDKVRFTADKAKLHLFDT 355
              +  V + E +G  ++L        + I  ++     +  G+ +RF  ++  +HLFD+
Sbjct: 299 EAIDLKVIVSEYIGAQSVLLCN--CGAQKIEVELKSETPIALGETLRFAVNREAIHLFDS 356


Lambda     K      H
   0.320    0.137    0.387 

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: 351
Number of extensions: 12
Number of successful extensions: 3
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: 362
Length of database: 363
Length adjustment: 29
Effective length of query: 333
Effective length of database: 334
Effective search space:   111222
Effective search space used:   111222
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.8 bits)
S2: 49 (23.5 bits)

This GapMind analysis is from Sep 24 2021. 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