![]() |
![]()
| ![]() |
![]()
NAMEdebruijn - de Bruijn sequence generator SYNOPSISdebruijn [-] -a str -n k DESCRIPTIONdebruijn generates (on standard output) a string over the specified alphabet containing every possible word (substring) of the specified length exactly once. Note: Substrings are not taken to wrap around, so the first k-1 characters repeat at the end. OPTIONSA summary of options is included below. AUTHORThe National Center for Biotechnology Information.
|