Repository navigation
Conversation
Contributor
|
Hi! I think this strategy will probably conflict with the |
Contributor
Author
|
The in-memory representation will change anyway, regardless of the file format version, so we'll have to change everything that manipulates the sequences directly. But it should be straightforward to linearize the representation and store all sequences independently if requested. |
This branch has not been deployed
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Changelog Entry
To be copied to the draft changelog by merger:
vg dedupsubcommand to enable sequence deduplication in GBZ v4.Description
This PR adds
vg dedupsubcommand for content-aware node chopping. It takes an unchopped graph as an input and uses contend-defined chunking for finding good positions to chop long nodes. The purpose is to enable sequence deduplication in full graphs.Instead of storing a concatenation of the sequences over all nodes, GBZ v4 will store an arbitrary superstring of the sequences. In an HPRC v2.1 full graph, the total length of the nodes is 63 Gbp due to unaligned centromeres. Preliminary experiments suggest that the length of the stored superstring should be less than 10 Gbp with the default
vg dedupparameters. That should enable working with full graphs on a 32 GB laptop.