Alignments for a candidate for dgoD in Tistlia consotensis USBA 355

GapMind for catabolism of small carbon sources

Alignments for a candidate for dgoD in Tistlia consotensis USBA 355

Align L-arabinonate dehydratase; ArDHT; D-fuconate dehydratase; Galactonate dehydratase; L-arabonate dehydratase; EC 4.2.1.25; EC 4.2.1.67; EC 4.2.1.6 (characterized)
to candidate WP_085122148.1 B9O00_RS09050 IlvD/Edd family dehydratase

Query= SwissProt::B5ZZ34
         (579 letters)



>NCBI__GCF_900177295.1:WP_085122148.1
          Length = 594

 Score =  485 bits (1249), Expect = e-141
 Identities = 258/589 (43%), Positives = 377/589 (64%), Gaps = 19/589 (3%)

Query: 9   RKLRSQEWYGGTSRD---VIYHRGWLKNQGYPHDLFDGRPVIGILNTWSDMTPCNGHLRE 65
           ++LRSQEW+          +Y   +L       +L  G+P+IGI  T SD+ PCN H  E
Sbjct: 7   KRLRSQEWFDNPDNPGMTALYLERYLNYGLTREELQSGKPIIGIAQTGSDLAPCNRHHLE 66

Query: 66  LAEKVKAGVWEAGGFPLEVPVFSASENTFRPTAMMYRNLAALAVEEAIRGQPMDGCVLLV 125
           LA++V+ G+  AGG  +E PV    E   RPTA + RNLA L + E + G P+DG VL  
Sbjct: 67  LAKRVRDGIAAAGGIAMEFPVHPIQETGKRPTAALDRNLAYLGLVEVLYGYPIDGVVLTT 126

Query: 126 GCDKTTPSLLMGAASCDLPSIVVTGGPMLNGYFRGERVGSGTHLWKFSEMVKAGEMTQAE 185
           GCDKTTP+ LMGAA+ DLP+IV++GGPML+G+ +GE  GSGT +W   +++ AGE+   E
Sbjct: 127 GCDKTTPAQLMGAATVDLPAIVLSGGPMLDGHHKGELAGSGTVVWDSRKLLAAGEIDYEE 186

Query: 186 FLEAEASMSRSSGTCNTMGTASTMASMAEALGMALSGNAAIPGVDSRRKVMAQLTGRRIV 245
           F++  A+ + S G CNTMGTA +M S+AE LGM+L G AAIPG    R  MA  TG+RIV
Sbjct: 187 FIKRVAASAPSVGHCNTMGTALSMNSLAEGLGMSLPGCAAIPGPYRERAQMAWATGKRIV 246

Query: 246 QMVKDDLKPSEIMTKQAFENAIRTNAAIGGSTNAVIHLLAIAGRVGIDLSLDDWDRCGRD 305
           +MV++DL+PS++MTK AFENAI   +A+G STNA  HL+AIA  +G++L+++DW R G D
Sbjct: 247 EMVREDLRPSQVMTKAAFENAIVLCSALGASTNAPPHLIAIARHMGVELTMEDWQRVGFD 306

Query: 306 VPTIVNLMPSGKYLMEEFFYAGGLPVVLKRLGEAGLLHKDALTVSGETVWDEVKDVVNWN 365
           VP IV+  P+G++L E F  AGG+P V+  L EAGL+ + A+TVSG T+ +E++    ++
Sbjct: 307 VPLIVDCQPTGRFLGERFHRAGGVPAVMAELIEAGLIREQAMTVSGRTIGEEMRGQFTFD 366

Query: 366 EDVILPAEKALTSSGGIVVLRGNLAPKGAVLKPSAASP-----------HLLVHKGRAVV 414
            +VI   ++ L  S G++V+ GNL    AV+K SA  P           H  + +G A+V
Sbjct: 367 REVIRTVKEPLKQSAGLLVMGGNLF-DAAVMKTSAIGPDFRRRYLENPEHPGMFEGTAIV 425

Query: 415 FEDIDDYKAKINDDNLDIDENCIMVMKNCGPKGYPGMAEVGNMGLPPKVLKKGILDMVRI 474
           FE  +DY  +I+D +L IDEN I+ ++NCGP GYPG AEV NM  P +++K+GI ++  I
Sbjct: 426 FEGPEDYHHRIDDPDLPIDENAILFIRNCGPVGYPGSAEVVNMQPPARLIKRGITELPTI 485

Query: 475 SDARMSGTAYGTVVLHTSPEAAVGGPLAVVKNGDMIELDVPNRRLHLDISDEELARRLAE 534
            D R SGT+    +L+ +PEAAVGG LA++  GD + +D+ NRR+ + + + E+ RR A 
Sbjct: 486 GDGRQSGTSASPSILNAAPEAAVGGGLALLATGDRVRVDLKNRRVDMLVEEAEIERRRAA 545

Query: 535 WQPNHDLPTSGYAFLHQQHVEGADTGADLD----FLKGCRGNAVGKDSH 579
           W P++    + +  +++  V   D G  L+    +L+      + +D+H
Sbjct: 546 WTPSYPEHQTPWQEIYRSMVGQLDGGGCLEPATLYLRIAETKGLPRDNH 594


Lambda     K      H
   0.318    0.135    0.408 

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: 969
Number of extensions: 67
Number of successful extensions: 4
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: 579
Length of database: 594
Length adjustment: 37
Effective length of query: 542
Effective length of database: 557
Effective search space:   301894
Effective search space used:   301894
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: 41 (21.7 bits)
S2: 53 (25.0 bits)

This GapMind analysis is from Apr 09 2024. 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