Follow these steps to construct and analyze a De Bruijn Graph:
Note: Ensure that your sequence is valid and the k-mer size is appropriate.
πΉ Nodes: Each node represents a k-1 sequence (prefix/suffix of k-mers).
πΉ Edges: Show transitions from one k-1 sequence to another using k-mers.
The goal of a De Bruijn Graph is to reconstruct the original sequence by connecting overlapping k-mers.
𧬠Entered Nucleotide Sequence:
π’ Selected K-mer Size:
π Sequence Length: bases
π Number of K-mers Formed:
π Number of Nodes Formed: