Download Latest Version lccs0.1.tar.gz (19.1 kB)
Email in envelope

Get an email when there's a new version of lccs

Home / LCCS
Name Modified Size InfoDownloads / Week
Parent folder
CCDS6620.1.fa 2015-01-16 2.5 kB
0
CCDS32513.1.fa 2015-01-16 8.1 kB
0
gpl-3.0.txt 2015-01-16 35.1 kB
0
LCCS.cxx 2015-01-16 7.8 kB
0
makefile 2015-01-16 106 Bytes
0
README 2015-01-16 988 Bytes
0
Totals: 6 Items   54.7 kB 0 
 Program: Longest Common CDS Subsequence 0.1
 Author: Sanket Desai.
 * Copyright (C) 2014 Sanket Desai.
 * C program implementation of LCS adopted from program written by Neil Jones [Copyright (C) 2005 Neil Jones].

 * Released under GPL.
 * Find a copy of licence in the directory or find it at http://www.gnu.org/licenses/gpl-3.0.txt

 * This is an implementation, in C++, of the Longest Common CDS Subsequence algorithm.
 * That is, given two CDS sequences A and B, this program will find the longest sequence of CDS that is common and ordered in A and B.

 * Program takes two file names which contain fasta format CDS sequences

 * INSTALL:
 * To install in Unix-like environment, just type 'make'. An executable 'lccs' should be created.
 * To test the program, type 'make test'. The program 'lccs' should execute using the CCDS files present in DIR

 * USAGE: ./lccs <input file 1> <input file 2>

 * TO-DO: a. Synonymous codon bias should be considered while finding the sub-CDS.
Source: README, updated 2015-01-16