View on GitHub

Cola Sequence Aligner

Modular and Configurable Optimal Sequence Aligner

Download this project as a .zip file Download this project as a tar.gz file

Methods

BMC Source Code for Biology and Medicine


Overview

Cola consists of an efficient implementation of a collection of sequence alignment algorithms, extending the Smith-Waterman and Smith-Waterman-Gap-Affine methods by the ability to apply a scoring function that is an arbitrary function of the size of consecutive nucleotide matches.


Getting Started

If you want to integrate Cola with your code, that is simple. Look into src/runCola as an example of how the Cola aligner object can be used.


Once you unzip the code-base, run make in the parent directory. Then you will have the executables created and will be able to follow the instructions below:


The main access point for a user to run cola is through runCola which accepts the following arguments:


N.B. Only the first 3 arguments are compulsory and the rest are optional. If the aligner penalty parameters are not provided by user, defaults will be used.


See following examples for more detail:


To run in one of 4 modes using the sample data provided in the sample directory:


  1. Nonlinear Scoring Gap-Affine (NSGA):


    ./runCola -t sample/homo.X.part.fa -q sample/canis.X.part.fa -a 1

  2. Nonlinear Scoring (NS):


    ./runCola -t sample/homo.X.part.fa -q sample/canis.X.part.fa -a 2

  3. Smith-Waterman Gap-Affine (SWGA):


    ./runCola -t sample/homo.X.part.fa -q sample/canis.X.part.fa -a 3

  4. Smith-Waterman (SW):


    ./runCola -t sample/homo.X.part.fa -q sample/canis.X.part.fa -a 4

  5. See Cola manuscript for more detail on the underlying algorithm and methodology.