Alignments for a candidate for fruA in Rhodococcus qingshengii djl-6-2

GapMind for catabolism of small carbon sources

Alignments for a candidate for fruA in Rhodococcus qingshengii djl-6-2

Align Fructose PTS Enzyme IIBC, FruA (characterized)
to candidate WP_050655799.1 C1M55_RS13985 PTS transporter subunit EIIA

Query= TCDB::Q9RZP7
         (598 letters)



>NCBI__GCF_002893965.1:WP_050655799.1
          Length = 689

 Score =  384 bits (987), Expect = e-111
 Identities = 259/613 (42%), Positives = 347/613 (56%), Gaps = 55/613 (8%)

Query: 6   AVTACPTGIAHTFMAAEALRRAALA-AGHDIRVETQGSVGTADA---LTPSEIAAADAVI 61
           + T  P GIA     AEA+  A+L  A  D +V+     G AD    +   E A A+ + 
Sbjct: 64  SATGLPGGIAIPHCRAEAVSSASLGFARLDPKVDFGAPDGPADLVFLIAAPEGAGAEHMK 123

Query: 62  LATDVRVDEARFAGKPVVQTSTQDA---------IRNAAGLVAQATAALGAAAPAAAPVS 112
           L + +    AR   +P   TS ++A         +        +  AA  AAA   APVS
Sbjct: 124 LLSSL----ARALVRPAFVTSLREASTPDEIVRLVDEVLNPAPKDPAAKAAAATPPAPVS 179

Query: 113 DGK-------------KYIVGITSCPTGIAHTFMAAEGLEGGAKSLGYDVKIETQGSVGA 159
            GK             ++IV +T+CPTGIAHT+MAA+ L    +  G  V +ETQGS G+
Sbjct: 180 TGKHATEETPAPAPAERHIVAVTACPTGIAHTYMAADSLVAAGERAGVKVHVETQGSSGS 239

Query: 160 GNALSDDDVRRADVVVIAADTNVD-LSRFAGKRVYQTGTKPAIKDGAAVVRTALAEAPVY 218
              L    +  A  V+ A D  V    RFAGK V  +G K AI +   +    LAEA   
Sbjct: 240 -TPLDPSVIAGAAAVIFATDVGVKGRERFAGKPVVASGVKRAINEPDKM----LAEALRA 294

Query: 219 GSGSAASSGDYVADAAAAKAAKNAGVPSFYKH-LMTGVSHMLPFVVAGGLLIALGFAFGS 277
               AA++ D  A AAA   A + G  +  +  L+TGVS+M+PFV AGGLLIALGF  G 
Sbjct: 295 SENPAAATVDGTAAAAADSDAGSVGFGTHLRQVLLTGVSYMIPFVAAGGLLIALGFLLGG 354

Query: 278 FQFGDQGIFIY---------EDKYAGTIGNLLFNIGANGAFKLFVPVLAGYIAFSIADRP 328
           ++       I          +   A  +G +LF IG+  AF   VP LAGYIAF+IADRP
Sbjct: 355 YEISGPAKDIVLNNSITNLPDGGLATYLGAVLFQIGSL-AFSFLVPALAGYIAFAIADRP 413

Query: 329 GLAPGMVGGLIAANTGSGFLGGMVAGFIAGYFVRWLNRALKLPRTLEGLKPTLLLPLLGT 388
           G+APG   G +A   G+GF+GG+V G IAG    ++ R + +P+ L GL P +++PL  T
Sbjct: 414 GIAPGFTAGAVAVFVGAGFIGGLVGGLIAGVVALYIGR-IAVPQWLRGLMPVVIIPLFAT 472

Query: 389 LVVGLLMLTVVGKPVAAALTAVTNWLQGLGQGSAGLLGALLGGMMAFDMGGPINKAAYTF 448
           LVVG LM  V+G+P+AA  + +T+WL GL   SA  LG +LG MM FD+GGP+NKAAY F
Sbjct: 473 LVVGALMFIVLGRPLAAITSGLTDWLNGLSGSSAIFLGIILGLMMCFDLGGPVNKAAYAF 532

Query: 449 S-TGLLTN--KVYGPIAATMAAGMTPPLALFFATQLFKNR-FTKDEQEAGKAAGVLGISF 504
           +  GL  N       +AA MAAGM PPLA+  A+ + + + F++ E+E GKAA +LG +F
Sbjct: 533 AVAGLNVNDPATLRIMAAVMAAGMVPPLAMALASTVLRPKLFSEAERENGKAAWLLGSAF 592

Query: 505 ITEGAIPFAARDPLRVIPALMAGSAVAGFISMATGCLLRAPHGGIFVLFIPNAVTNLPMY 564
           I+EGAIPFAA DPLRVIP++MAG AV G + MA    L APHGGIFV F   AV  +  +
Sbjct: 593 ISEGAIPFAAADPLRVIPSMMAGGAVTGALIMAFDVTLSAPHGGIFVFF---AVGGIGWF 649

Query: 565 IVAIVAGTAVSTL 577
           +V++ AGT V+ L
Sbjct: 650 LVSLAAGTVVAAL 662


Lambda     K      H
   0.321    0.136    0.393 

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: 932
Number of extensions: 59
Number of successful extensions: 12
Number of sequences better than 1.0e-02: 1
Number of HSP's gapped: 2
Number of HSP's successfully gapped: 2
Length of query: 598
Length of database: 689
Length adjustment: 38
Effective length of query: 560
Effective length of database: 651
Effective search space:   364560
Effective search space used:   364560
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: 54 (25.4 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