Alignments for a candidate for mcm-large in Sedimenticola selenatireducens DSM 17993

GapMind for catabolism of small carbon sources

Alignments for a candidate for mcm-large in Sedimenticola selenatireducens DSM 17993

Align methylmalonyl-CoA mutase (subunit 2/2) (EC 5.4.99.2) (characterized)
to candidate WP_029133988.1 A3GO_RS0114395 methylmalonyl-CoA mutase

Query= BRENDA::O74009
         (563 letters)



>NCBI__GCF_000428045.1:WP_029133988.1
          Length = 1085

 Score =  308 bits (789), Expect = 7e-88
 Identities = 211/601 (35%), Positives = 326/601 (54%), Gaps = 56/601 (9%)

Query: 9    LKKIKEEEKRWEETTVKKFLEKAPERKEKFMTDD--------------------GFEIKR 48
            L ++  E     +   KK LE  P+ K+ +  D+                    G +I +
Sbjct: 487  LDRLIAERDEALDQRAKKLLEIWPQVKQSYAGDEYVVKIRDKEIRTQITRTTLSGTKIPK 546

Query: 49   IYTPA--DLGEDWNYMEKLGFPGEYPFTRGVYATMYRGRIWTMRQYAGYATAEESNKRYK 106
            +  P   D GE   ++     PG +P+T GV+A    G   T R +AG   A  +N+R+K
Sbjct: 547  VVLPKYEDHGELLKWLLLENVPGTFPYTAGVFAFKREGEDPT-RMFAGEGDAFRTNRRFK 605

Query: 107  YLLSQGQTG-LSVAFDLPTQLGYDSDH-PLAEGEVGKVGVAIDSLWDMRILFDGIPLDKV 164
             L        LS AFD  T  G D D  P   G++G  GV+I +L DM++L+DG  L   
Sbjct: 606  KLSEHSDAKRLSTAFDSVTLYGCDPDERPDIYGKIGNSGVSIATLDDMKVLYDGFDLCNP 665

Query: 165  STS--MTINSTAANLLAMYILVAEEQGVSQ----------------------EKLRGTVQ 200
            STS  MT+N  A  +LAM++  A +Q +++                        +RGTVQ
Sbjct: 666  STSVSMTVNGPAPMILAMFLNSAIDQQINKFETDNGRQPTDEEIEKIRAWTLSNVRGTVQ 725

Query: 201  NDILKEYIARGTYIFPPQPSMRLTTDIIMYCAEN-VPKWNPISISGYHIREAGANAVQEV 259
             DILKE   + T IF  + +++L  DI  Y   + V  +  +SISGYHI EAGAN + ++
Sbjct: 726  ADILKEDQGQNTCIFSTEFALKLMGDIQEYFVHHQVRNFYSVSISGYHIAEAGANPISQL 785

Query: 260  AFTLADGIEYVKAVIERGMDVDKFAPRLSFFFAAHNNFLEEIAKFRAARRLWAYIMKEWF 319
            AFTLA+G  YV+  + RGMD+D+FAP LSFFF+ +    E     R ARR+WA  M+  +
Sbjct: 786  AFTLANGFTYVETYLARGMDIDEFAPNLSFFFS-NGMDPEYTVMGRVARRIWATAMRFKY 844

Query: 320  NAKNPRSMMLRFHTQTAGSTLTAQQPENNIVRVAIQALAAVLGGTQSLHTNSYDEALSLP 379
             A N RS  L++H QT+G +L AQ+ + N +R  +QAL A+     SLHTN+YDEA++ P
Sbjct: 845  GA-NERSQKLKYHIQTSGRSLHAQEMDFNDIRTTLQALIAIYDNCNSLHTNAYDEAITTP 903

Query: 380  TEKSVRIALRTQQIIAYESGVVDTVDPLGGAYYIEWLTDHIYEEALKYIEKIQKMGGMMR 439
            TE+SVR AL  Q II  E G+    +P  GA+ I+ LT+ + E  L   E+I + GG++ 
Sbjct: 904  TEESVRRALAIQLIINNEWGLTKNENPNQGAFIIDELTELVEEAVLSEFERISERGGVLG 963

Query: 440  AIERGYVQKEIAEAAYKYQKEIEEGKRIIVGVNAFVTDEPIEVEILKVDPSIREKQIERL 499
            A+E GY + +I + +  Y+    +G   I+GVN F+  +  E   +++  S  E+++ ++
Sbjct: 964  AMETGYQRGKIQDESLHYEHMKHDGSLPIIGVNTFLNPKGNEEVTIELARSTEEEKLSQI 1023

Query: 500  KKLR--SERDNKKVQEALDKLRNAAEKEDENLMPYIIEAHRHLATLQEVTDVLREIWGEY 557
            K+LR  ++R       AL+++R+AA   +EN+   ++ A R   +L ++++ L E+ G+Y
Sbjct: 1024 KRLREFNQRHATAADTALERIRSAA-INNENIFVELMNAVRS-CSLGQISNALYEVGGQY 1081

Query: 558  R 558
            R
Sbjct: 1082 R 1082


Lambda     K      H
   0.318    0.134    0.388 

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: 1234
Number of extensions: 68
Number of successful extensions: 7
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: 563
Length of database: 1085
Length adjustment: 41
Effective length of query: 522
Effective length of database: 1044
Effective search space:   544968
Effective search space used:   544968
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: 55 (25.8 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 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