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

longer tandem repeat identification #11

Open
jbelyeu opened this issue Apr 14, 2022 · 1 comment
Open

longer tandem repeat identification #11

jbelyeu opened this issue Apr 14, 2022 · 1 comment

Comments

@jbelyeu
Copy link

jbelyeu commented Apr 14, 2022

I'm interested in identifying tandem repeats longer than 2kb. Have been reading through the original paper and the code to understand the current upper bound; iiuc the main limitation is based on the extent of the simulation data that's included in the init_and_fill_coin_toss_stats2000_with_4tuplesizes() function. If I run my own simulations to generate longer waitdata and sumdata arrays, could that allow detection of repeats with periods of say 10kb or am I missing other challenges?

@thekswenson
Copy link

I too am interested in calculating tandem repeats longer than 2kb.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

2 participants