GapMind for catabolism of small carbon sources

 

Alignments for a candidate for livH in Bradyrhizobium sp. BTAi1

Align Branched-chain amino acid ABC transporter permease LivH; SubName: Full=Branched-chain amino acid transporter permease subunit LivH; SubName: Full=L-leucine ABC transporter membrane protein /L-isoleucine ABC transporter membrane protein /L-valine ABC transporter membrane protein (characterized, see rationale)
to candidate WP_012045884.1 BBTA_RS28020 branched-chain amino acid ABC transporter permease

Query= uniprot:A0A0D9B2B6
         (307 letters)



>NCBI__GCF_000015165.1:WP_012045884.1
          Length = 290

 Score =  166 bits (419), Expect = 8e-46
 Identities = 99/293 (33%), Positives = 167/293 (56%), Gaps = 15/293 (5%)

Query: 9   QQLVNGLTVGSTYALIAIGYTMVYGIIGMINFAHGEVYMIGSYVAFIAIAGLAMMGLDSV 68
           + L+NGL +G+ YALIA+G T++YG++ ++NFAHG +  +  ++ ++  A     GLD  
Sbjct: 9   EALLNGLMLGAIYALIALGLTLIYGVLHIVNFAHGALLTVAMFMVWLVCA---RYGLDPY 65

Query: 69  PLLMTAAFIASIVVTSSYGYSIERIAYRPLRGSNRLIPLISAIGMSIFLQNTVLLSQDSK 128
             ++  A      +  + GY ++R    P         L+  +G+SI ++N +L +  S 
Sbjct: 66  LAILVVA-----PLMFALGYGLQRFIIGPASHGKDNGILLVTLGLSIIIENALLAAFQSD 120

Query: 129 DKSIPNLIPGNFA-IGPGGAHEVLISYMQIVVFVVTLVAMLGLTLFISRSRLGRACRACA 187
            ++I          +GP     +L+S+ ++V F VT+   + L L + ++ +G+A RA A
Sbjct: 121 TRTITTDYSFRVVELGP-----LLLSFPRVVGFGVTIATTILLWLVLHQTDIGKAIRAVA 175

Query: 188 EDIKMANLLGINTNNIIALTFVIGAALAAIAAVLLSMQYGVINPNAGFLVGLKAFTAAVL 247
           ++   A+L+GI+  ++ A+TF IG A  A+AA LL   +  ++P  G    L AFT  VL
Sbjct: 176 KEKLGASLVGISVPHVYAMTFAIGCACLAVAAGLLMPSF-YVSPKTGAAFVLVAFTIVVL 234

Query: 248 GGIGSIPGAMLGGLVLGVAEAFGADIFGDQYKDVVAFGLLVLVLLFRPTGILG 300
           GG+GSIPGA++GGL++GV EA  +   GD    +  F + ++ LL RPTG+ G
Sbjct: 235 GGMGSIPGALIGGLLIGVVEAASSLFLGDSLGQIGIFLIFIVTLLVRPTGLFG 287


Lambda     K      H
   0.327    0.144    0.411 

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: 288
Number of extensions: 22
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: 307
Length of database: 290
Length adjustment: 27
Effective length of query: 280
Effective length of database: 263
Effective search space:    73640
Effective search space used:    73640
Neighboring words threshold: 11
Window for multiple hits: 40
X1: 15 ( 7.1 bits)
X2: 38 (14.6 bits)
X3: 64 (24.7 bits)
S1: 40 (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.

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