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

COBS postprocessing slower than COBS #178

Open
karel-brinda opened this issue Sep 21, 2022 · 2 comments
Open

COBS postprocessing slower than COBS #178

karel-brinda opened this issue Sep 21, 2022 · 2 comments

Comments

@karel-brinda
Copy link
Owner

karel-brinda commented Sep 21, 2022

This is a note for the future.

When too many matches are reported by COBS (eg large Illumina experiments with many matches due to reads being short), the post-processing of its output (despite being very simple, essentially just removing IDS and filtering matches based on the max best hits) becomes the bottleneck.

image

@karel-brinda
Copy link
Owner Author

@karel-brinda
Copy link
Owner Author

Idea for the future: other matches can be directly skipped after the first match is rejected here (and not necessary to repeatedly extract #kmers): https://github.com/karel-brinda/mof-search/blob/08c28f8366ad35ffcb79f9953b3668494e47c38a/scripts/postprocess_cobs.py#L38

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

No branches or pull requests

1 participant