[Biopython] Biopython project

[Spasso Tech]

Good morning,

My name is Matheus,

I wrote an algorithm of permutation, this algorithm make any permutation
with any string length.

I every seen problems with the length of strings for a permutation because
the algorithms that i see on the internet don't support permutation above
10 elements because of level of the processing.

The permutators that i see enumerate the permutation but don,t access
efficiently the permutations enumerate because firtst generate all
permutations for after access te possition in one array.

On my algorithm for example i can permute 50 elements that give
30414093201713378043612608166064768844377641568960512000000000000
possibilities, if i need access the permutation order
15414232157133780436126081660647688443776415689605121234333 i just need to
pass that number and i can access the permutation in order
42321571337804361260816606476884437764156896051212345511  in
 fractions of seconds.

This algorithm is written in Python and in C. They told me that genetics
area is very usual for the application of this code.

For example to permute the triplet code and generate all probability of
encodes.

In your project have this resource? My code have other mathematical
characteristics that can be explorate is very interesting .

Thank you for your patience and consideration.
Sorry my English

Regards,

Matheus Henrique Ferreira Brandão
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mailman.open-bio.org/pipermail/biopython/attachments/20190320/9a2b911f/attachment.html>