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
Currently, as we build a path I test whether it ends in the end k-mer. But it would make more sense to test whether it ends in any of the end k-mers we have which exist in the graph.
To test which end k-mers exist we can use the hash/method we produce for #59 to mark all end k-mers that exist in the graph upfront (and their reverse).
The text was updated successfully, but these errors were encountered:
Currently, as we build a path I test whether it ends in the end k-mer. But it would make more sense to test whether it ends in any of the end k-mers we have which exist in the graph.
To test which end k-mers exist we can use the hash/method we produce for #59 to mark all end k-mers that exist in the graph upfront (and their reverse).
The text was updated successfully, but these errors were encountered: