Skip to content

GitLab

  • Projects
  • Groups
  • Snippets
  • Help
    • Loading...
  • Help
    • Help
    • Support
    • Community forum
    • Submit feedback
    • Contribute to GitLab
  • Sign in
BiG-SCAPE
BiG-SCAPE
  • Project overview
    • Project overview
    • Details
    • Activity
    • Releases
  • Repository
    • Repository
    • Files
    • Commits
    • Branches
    • Tags
    • Contributors
    • Graph
    • Compare
  • Issues 6
    • Issues 6
    • List
    • Boards
    • Labels
    • Service Desk
    • Milestones
  • Merge Requests 0
    • Merge Requests 0
  • CI / CD
    • CI / CD
    • Pipelines
    • Jobs
    • Schedules
  • Operations
    • Operations
    • Incidents
    • Environments
  • Packages & Registries
    • Packages & Registries
    • Container Registry
  • Analytics
    • Analytics
    • CI / CD
    • Repository
    • Value Stream
  • Wiki
    • Wiki
  • Members
    • Members
  • Collapse sidebar
  • Activity
  • Graph
  • Create a new issue
  • Jobs
  • Commits
  • Issue Boards
  • medema-group
  • BiG-SCAPEBiG-SCAPE
  • Wiki
  • Alignment Modes

Last edited by Jorge Navarro Muñoz May 21, 2018
Page history

Alignment Modes

To select the domains predicted in each BGC for the distance calculation, BiG-SCAPE uses two strategies. In the global mode, all domains from both BGCs are taken into account, whereas in the glocal mode, only a subset of the domains is chosen. The logic in glocal mode is the following:

During pairwise distance calculation, genes are represented as a concatenation of (Pfam) domain ids, and each BGC in the pair is represented as a list of those domain concatenations (strandedness is not taken into account).

BiG-SCAPE then uses the SequenceMatcher method from Python's difflib library to to find the longest match (internally called the LCS or "Longest Common Subcluster"). The second BGC is tried in the reverse orientation and the orientation with the largest LCS is kept.

To proceed to the next step, the LCS must be either 3 genes long, or contain at least one gene marked by antiSMASH as "Core Biosynthetic"

In the extension stage the selection of domains is extended for the BGC with least amount of genes up(down)stream. If the amount of genes up(down)stream is the same, each expansion will be attempted and scored, and the one with the best score will be kept. The remaining BGC domain selection (per side) will be tried to be expanded according to the following scoring algorithm in the Alignment Stage: for every gene in the reference BGC, a gene with the same domain organization is searched for in the remaining BGC. If such gene is found, the score will be added a bonus (match=5) plus a penalty proportional to the distance from the current position (number of genes * gap penalty where gap=-2) and the current position will be moved to the position of the matching gene. If a gene with the same domain organization is not found, the score will be decreased with a penalty (mismatch=-3)

Clone repository
  • Alignment Modes
  • GCFs and GCCs
  • anchor file
  • big scape classes
  • domain prediction
  • Home
  • input
  • installation
  • output
  • parameters