Skip to content
New issue

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

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

Already on GitHub? # to your account

General classification #18

Open
erikrikarddaniel opened this issue Apr 4, 2024 · 1 comment
Open

General classification #18

erikrikarddaniel opened this issue Apr 4, 2024 · 1 comment
Labels
enhancement New feature or request

Comments

@erikrikarddaniel
Copy link
Member

Description of feature

Given a single query fasta file with sequences and a set of hmm files with corresponding reference tree and alignment, search the query sequences with all hmm files. Among hits that qualify above a bitscore and/or e-value cutoff, identify the hmm(s) for which each sequence scored best (bitscore). For every hmm, pass the assigned sequences to placement.

The pipeline will be called with a samplesheet without the queryseqfile. Query sequences will instead be passed via --queryseqfile. This combination of parameters, i.e. --input in combination with --queryseqfile, will trigger the new behaviour. Parameters, passed to hmmsearch, for minimum bitscore and maximum e-value will be added.

@erikrikarddaniel erikrikarddaniel added the enhancement New feature or request label Apr 4, 2024
@adriaaula
Copy link

Hi!
That would be really cool. I can try to test it out with my data anytime.

# for free to join this conversation on GitHub. Already have an account? # to comment
Labels
enhancement New feature or request
Projects
None yet
Development

No branches or pull requests

2 participants