Vertex expansion method for variable-length kmer queries based on multi-step bidirectional de Bruijn graphs
A vertex and forward edge technology, which is applied in the field of vertex expansion of variable-length kmer queries, can solve the problems of cost, large memory and computing time, repeated sequences cannot be decoupled, etc., and achieve the effect of increasing length, control and improvement
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0075] In order to make the objectives, technical solutions and advantages of the present invention clearer, the present invention will be further described in detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present invention, but not to limit the present invention.
[0076] In addition, the technical features involved in the various embodiments of the present invention described below can be combined with each other as long as they do not conflict with each other.
[0077] The purpose of the present invention is to design a bifurcation vertex expansion method based on variable-length kmer query, which will make the De Bruijn graph continue to shrink and the contigs continue to expand, and at the same time, it will not introduce errors, resulting in the decline of contig quality and accuracy.
[0078] The invention provides a vertex expansion method bas...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 