Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

update readme #5

Open
wants to merge 2 commits into
base: main
Choose a base branch
from
Open
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
14 changes: 9 additions & 5 deletions README.md
Original file line number Diff line number Diff line change
@@ -1,11 +1,9 @@
# AdaOrder
AdaOrder is an algorithm for adapting the minimizer order to an input dataset.
It aims to flatten the k-mer load distribution across minimizers.

This implementation of AdaOrder corresponds to the following paper: .
This implementation of AdaOrder is described in the following paper: .

To cite this paper use the following form:


In `orders_minimizer_7.zip` are pre computed orders by AdaOrder, on 4 datasets used in the paper with `k=28,55`.

## Usage

Expand All @@ -29,6 +27,12 @@ AdaOrder can be controlled by several command line options and flags.
| `‑p <float>` | Set the penalty factor of AdaOrder. | `0.01` |
| `‑in <path>` | Dataset to generate AdaOrder for. | |


Precomputed orders: Orders computed by AdaOrder, on 4 datasets from the paper (H. Sapiens, A. Thaliana and fresh water metagenome) with `k=28,55`. By using them for other datasets from the same species, AdaOrder computing time can be drastically reduced or avoided altogether.




## DGerbil
DGerbil is a modification of Gerbil, a memory efficient k-mer counter, that uses AdaOrder instaed of signature, for improved memory usage.
Its source code is found at https://github.com/Shamir-Lab/DGerbil.