You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
I linked your library and I'm able to use a combination of a KmerIterator and your CompactedDBG class to query k-mers in a de Bruijn graph I have stored on my disk as a GFA. However I am looking for a way to map the query results back to the name or index of each contig ("segment" in GFA terminology). Is there an existing way to do this? If not in Bifrost, is there an easy way to adapt it? or would you recommend a different method entirely?
Thanks
The text was updated successfully, but these errors were encountered:
Hi,
I linked your library and I'm able to use a combination of a
KmerIterator
and yourCompactedDBG
class to query k-mers in a de Bruijn graph I have stored on my disk as a GFA. However I am looking for a way to map the query results back to the name or index of each contig ("segment" in GFA terminology). Is there an existing way to do this? If not in Bifrost, is there an easy way to adapt it? or would you recommend a different method entirely?Thanks
The text was updated successfully, but these errors were encountered: