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

Neighbor discovery algorihtm #45

Open
4 tasks
ezorita opened this issue May 18, 2018 · 0 comments
Open
4 tasks

Neighbor discovery algorihtm #45

ezorita opened this issue May 18, 2018 · 0 comments

Comments

@ezorita
Copy link
Owner

ezorita commented May 18, 2018

Description

Use neighbor information on best alignment to find references to similar sequences and discover other unknown candidates.

Subtasks

  • Check neighbor information on best alignment(s).
  • Use alignment info to generate seeds to similar loci.
  • Filter out seeds to positions that have been already explored.

Acceptance criteria

  • Masked seeds should be discovered if alignment info is available on neighbor annotation.

Test procedures

This is a difficult test...

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

1 participant