lccs

Longest Common Coding Subsequence algorithm

Brought to you by: geniussank

Add a Review

Downloads: 0 This Week

Last Update: 2015-01-16

Download

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

This is an implementation, in C++, of the Longest Common CDS Subsequence algorithm. Given two CDS (coding) sequences A and B, program will find the longest sequence of CDS that is common and ordered in A-B and B-A.

Features

Bioinformatics algorithm
LCS for Codon Sequences
Implemented in C++

Project Activity

See All Activity >

Follow lccs

lccs Web Site

Other Useful Business Software

$300 Free Credits to Build on Google Cloud

New customers can spin up VMs, build with AI, and query data at no cost.

Put your $300 in credit toward real workloads, then keep building with free monthly usage for 20+ products. No commitment and no charge until you upgrade.

Rate This Project

User Reviews

Be the first to post a review of lccs!

Additional Project Details

Registered

2015-01-16

Report inappropriate content

$300 Free Credits to Build on Google Cloud

New customers can spin up VMs, build with AI, and query data at no cost.

Put your $300 in credit toward real workloads, then keep building with free monthly usage for 20+ products. No commitment and no charge until you upgrade.

Recommended Projects

BurnOut
BurnOut is a .Net program to scan CDs and DVDs in order to find which copy protection is used.
TheOpenCD
This project is inspired by an article at Newsforge. It aims to create an easy to install and easy to use series of CDs aimed at Microsoft Windows users. These CDs are collections of Open Source software.
SZnake_SHnake
New version of Snake. There is Duel Mode, The Longest Mode, 2p Mode, and off course simple Arcade.
sumi
sumi (formerly xtunes) is a comprehensive digital music system. It supports ripping cds, burning cds, playing mp3s, organizing digital music in a library with playlists.
LCS library
lcslib is a free library intended for finding longest common substrings in byte strings. It implements structure of suffix tree that is highly optimized for 256-character alphabet. It was originally implemented for finding signatures in TCP dumps.