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.

Sign up for GitHub

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

Jump to bottom

--max-edge-jump vs --max-path-jump #450

Open

COMInterop opened this issue Mar 2, 2025 · 0 comments

COMInterop commented Mar 2, 2025 •

edited

Loading

hello

i have some graphs that look like this:

i think they look nice but they seem to be 'sticky' across subtelomeres

i would like to ask the algorithm to not make joins across tens of Mb

can you say if it might be more effective to use --max-edge-jump or --max-path-jump, and maybe suggest a parameter range for testing?

thank you very much

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