Alignments for a candidate for vorA in Coprobacter fastidiosus NSB1

GapMind for catabolism of small carbon sources

Alignments for a candidate for vorA in Coprobacter fastidiosus NSB1

Align Ketoisovalerate oxidoreductase subunit VorA; VOR; 2-oxoisovalerate oxidoreductase alpha chain; 2-oxoisovalerate-ferredoxin oxidoreductase subunit alpha; EC 1.-.-.- (characterized)
to candidate WP_009319351.1 NSB1T_RS21620 2-oxoglutarate oxidoreductase

Query= SwissProt::P80907
         (478 letters)



>NCBI__GCF_000473955.1:WP_009319351.1
          Length = 253

 Score =  230 bits (586), Expect = 5e-65
 Identities = 108/249 (43%), Positives = 163/249 (65%), Gaps = 2/249 (0%)

Query: 6   IRKPDSLHEVFERKGGSAPTATHYCAGCGHGILHKLIGEAIDELGIQERSVMISPVGCAV 65
           I KP++L  V+++         HYC GC HG++HKL+ E IDE+G++E+++ I+PVGCAV
Sbjct: 6   IIKPENL--VYDKPRLMNDNPMHYCPGCSHGVVHKLVAEVIDEMGMEEQAIGIAPVGCAV 63

Query: 66  FAYYYFDCGNVQVAHGRAPAVGTGISRAEDTPVVLLYQGDGDLASIGLNETIQAANRGEK 125
           FAY Y D   ++ AHGRAPA+ T + R   + +V  YQGDGDLA+IG  ETI A NRGE 
Sbjct: 64  FAYNYIDIDWLEAAHGRAPAIATAVKRLNPSKMVFTYQGDGDLAAIGTAETIHACNRGEN 123

Query: 126 MAVFFVNNTVYGMTGGQMAPTTLIGEVTVTCPGGRDPRYAGYPLHMCELLDNLQAPVFIE 185
           + + F+NN +YGMTGGQMAPTTL G VT TCP GR+    GYPL +  L+  L    ++ 
Sbjct: 124 IVIIFINNAIYGMTGGQMAPTTLEGMVTATCPYGRNVELNGYPLKISNLVAQLDGTCYVT 183

Query: 186 RVSLADPKSIRKAKRAVKRALEIQRDGKGYAFVEVLSPCPTNLRQDAEGAERFLKEEMER 245
           R S+    +++KAK+A+++A E     KG + VE +S C +  +   + A +++++ M  
Sbjct: 184 RQSVHTAAAVKKAKKALRQAFENSMARKGTSLVEFVSTCNSGWKMTPDQANKWMEQNMFA 243

Query: 246 EFPVKNFRD 254
           ++P+ + ++
Sbjct: 244 KYPLGDLKN 252


Lambda     K      H
   0.318    0.137    0.402 

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: 309
Number of extensions: 9
Number of successful extensions: 1
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: 478
Length of database: 253
Length adjustment: 29
Effective length of query: 449
Effective length of database: 224
Effective search space:   100576
Effective search space used:   100576
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: 49 (23.5 bits)

Query= SwissProt::P80907
         (478 letters)



>NCBI__GCF_000473955.1:WP_009319350.1
          Length = 180

 Score =  112 bits (279), Expect = 1e-29
 Identities = 63/173 (36%), Positives = 99/173 (57%), Gaps = 1/173 (0%)

Query: 301 IAGFGGQGVLSMGLTLAQAACSEGRHTSWYPAYGPEQRGGTSSCGVVISGERVGSPAVDT 360
           IAGFGGQGVLSMG  LA +   E +  SW P+YGPEQRGGT++  V++S ER+ SP ++T
Sbjct: 7   IAGFGGQGVLSMGKILAYSGLMEDKEVSWMPSYGPEQRGGTANVTVILSDERISSPVLNT 66

Query: 361 PDVLVAFNQPSLDEFAGDVREGGIVLYDTATADFS-KKENLRAIGVPALEIAKEHGTGRA 419
            DV +  NQPSL++F   V+ GGI++YD      +  ++++    + A++ A E    +A
Sbjct: 67  FDVAIILNQPSLEKFENKVKPGGILIYDGYGIHHAPTRKDIDIYRIDAMDTAIEMENSKA 126

Query: 420 ANTAMLGVMMALGITGLDEESFRDAIRFTFSGKDKIIDINLKILEAGADWARK 472
            N  +LG ++ +      E   +   +       K+I +N + +  G +  RK
Sbjct: 127 FNMIVLGGLLKVKPMVSLENVLKGLKKSLPERHHKLIPMNEQAILKGMEIIRK 179


Lambda     K      H
   0.318    0.137    0.402 

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: 192
Number of extensions: 6
Number of successful extensions: 1
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: 478
Length of database: 180
Length adjustment: 26
Effective length of query: 452
Effective length of database: 154
Effective search space:    69608
Effective search space used:    69608
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: 48 (23.1 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