Align Fructose import ATP-binding protein FruK; EC 7.5.2.- (characterized)
to candidate WP_169717299.1 CEV31_RS02620 sugar ABC transporter ATP-binding protein
Query= SwissProt::Q8G847 (513 letters) >NCBI__GCF_002252445.1:WP_169717299.1 Length = 517 Score = 454 bits (1167), Expect = e-132 Identities = 234/504 (46%), Positives = 338/504 (67%), Gaps = 5/504 (0%) Query: 2 TDKNPIVVMKGITIEFPGVKALDGVDLTLYPGEVHALMGENGAGKSTMIKALTGVYKINA 61 T P++ + IT F GV ALD VD L GE+HAL+GENGAGKST+IK LTG Y Sbjct: 11 TPATPLLEARSITKSFLGVTALDRVDFVLNRGEIHALLGENGAGKSTLIKILTGAYHGFD 70 Query: 62 GSIMVDGKPQQFNGTLDAQNAGIATVYQEVNLCTNLSVGENVMLGHEKRGPFGIDWKKTH 121 GS+++DG +AQ GI TVYQEVNL NL+V EN+ LG + R ID ++ Sbjct: 71 GSVLLDGHAIAPASVAEAQTLGIGTVYQEVNLLENLTVAENLFLGRQPRRFGFIDRRRME 130 Query: 122 EAAKKYLAQMGLESIDPHTPLSSISIAMQQLVAIARAMVINAKVLILDEPTSSLDANEVR 181 + A LA+ GL +ID PLS+ S+A++Q++AIARA+ ++ KVL+LDEPT+SLDA+EV Sbjct: 131 KHATTLLARYGL-TIDVGAPLSAYSVAIRQIIAIARAVDVSGKVLVLDEPTASLDAHEVE 189 Query: 182 DLFAIMRKVRDSGVAILFVSHFLDQIYEITDRLTILRNGQFIKEVMTKDTPRDELIGMMI 241 LF ++R+++ G+ I+ ++HFLDQ+Y I D T+LRNG+ + + PR +LI MM+ Sbjct: 190 MLFGVLRQLQAEGLGIIIITHFLDQVYAIADSATVLRNGRLVGSRDLSELPRTDLISMML 249 Query: 242 GKSAAELSQIGAKKARREITPGEKPIVDVKGLGKKGTINPVDVDIYKGEVVGFAGLLGSG 301 G +L + + +++ + G GKKG++ P D+ I GE VG AGLLGSG Sbjct: 250 GH---QLQETVRRHLTEDVSDNTTAPIRFSGFGKKGSVAPFDLAIKPGEAVGIAGLLGSG 306 Query: 302 RTELGRLLYGADKPDSGTYTLNGKKVNISDPYTALKNKIAYSTENRRDEGIIGDLTVRQN 361 RTE L++G D+ DSGT T++GK + P A+ + A+ E R+ +GIIGD +V +N Sbjct: 307 RTETALLMFGVDQSDSGTLTIDGKDTKLPSPVAAIAERFAFCPEERKSDGIIGDFSVAEN 366 Query: 362 ILIALQATRGMFKPIPKKEADAIVDKYMKELNVRPADPDRPVKNLSGGNQQKVLIGRWLA 421 I +A+QA RG KPI +E +A+ ++Y+K L++RP DP++P+K LSGGNQQK ++ RWLA Sbjct: 367 IALAVQAKRGWSKPISSREKNALAERYIKALDIRPPDPNKPIKLLSGGNQQKAILARWLA 426 Query: 422 THPELLILDEPTRGIDIGAKAEIQQVVLDLASQGMGVVFISSELEEVVRLSDDIEVLKDR 481 T P LLILDEPTRGIDIGA AEI +++ +L ++GM +V ISSE EE+ +++ + VL DR Sbjct: 427 TDPRLLILDEPTRGIDIGAHAEILKLIGELCTEGMSLVIISSEFEELAAVANRVVVLSDR 486 Query: 482 HKIAEIENDDTVSQATIVETIANT 505 +AE++ ++ ++ IV IA+T Sbjct: 487 RHVAELKGEE-ITADNIVRAIADT 509 Lambda K H 0.316 0.135 0.376 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: 666 Number of extensions: 35 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: 513 Length of database: 517 Length adjustment: 35 Effective length of query: 478 Effective length of database: 482 Effective search space: 230396 Effective search space used: 230396 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.6 bits) S2: 52 (24.6 bits)
This GapMind analysis is from Sep 24 2021. The underlying query database was built on Sep 17 2021.
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:
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