Processing math: 100%

Glossary

Partial permutation

A partial permutation is an ordering of only k objects selected from a collection of n objects (kn). For example, a partial permutation of 3 of the first 8 positive integers is given by (5,7,2).

The statistic P(n,k) counts the total number of possible partial permutations of k objects chosen from a collection of n objects.

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.