View Code? Open in Web Editor
NEW
Growth function for autocomplentary circular tetranucleotide codes
Shell 9.10%
Python 1.14%
Java 89.76%
tetra's Introduction
¤ pawamoy
Timothée Mazzucotelli
✔️ Features
learned computer science at a french university
some years of experience in development, particularly with Python
really enjoy sharing code and contributing to other projects
🏭 Projects
aria2p
mkdocstrings
copier-pdm
tetra's People
Watchers
tetra's Issues
We should compress the results. But it means decompressing them when reading previous results...
Maybe some mechanisms to move unused previous results into another dir and then compress them would do the thing.
To improve perfs. Avoid string recopy and things like that.
Well, it's an object language so...
But reimplementing graph cycles detector with int instead of Integer could be interesting. True for all the code. A better approach would be to use another language (C / C++ ?)
Maybe Disruptor or Guava would be more performant.
Use Enums for tetras and tetra splits, ONLY when we don't have to iterate on them.