Processing math: 100%

Glossary

Common subsequence

A common subsequence of a collection of strings is a subsequence of all the strings in the collection. For example, ACGT is a common subsequence of the two strings ACAAGTAA and CAGTGCCGTTA. Note that ACGT is not a longest common subsequence of these two strings, as ACGTA appears in both strings and is one symbol longer.

Wikipedia

Welcome to Rosalind!

Rosalind is a platform for learning bioinformatics through problem solving.
Please login with Google/Twitter/Facebook or register a new account.