Glossary

Longest common subsequence

A longest common subsequence of a collection of strings is a common subsequence (i.e., a shared subsequence) of the collection of maximum length.

For example, "ACCTTG" is a longest common subsequence of the two strings "AACCTTGG" and "ACACTGTGA", as is "AACTGG".

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.