📦 velvet-long

10 pages

V

  • velvetg_127(1)de Bruijn graph construction, error removal and repeat resolution (MAXKMERLENGTH = 127)✨
  • velvetg_127_long(1)de Bruijn graph construction, error removal and repeat resolution (MAXKMERLENGTH = 127, LONGSEQUENCES)✨
  • velvetg_63(1)de Bruijn graph construction, error removal and repeat resolution (MAXKMERLENGTH = 63)✨
  • velvetg_63_long(1)de Bruijn graph construction, error removal and repeat resolution (MAXKMERLENGTH = 63, LONGSEQUENCES)✨
  • velvetg_long(1)de Bruijn graph construction, error removal and repeat resolution (LONGSEQUENCES)✨
  • velveth_127(1)simple hashing program (MAXKMERLENGTH = 127)✨
  • velveth_127_long(1)simple hashing program (MAXKMERLENGTH = 127, LONGSEQUENCES)✨
  • velveth_63(1)simple hashing program (MAXKMERLENGTH = 63)✨
  • velveth_63_long(1)simple hashing program (MAXKMERLENGTH = 63, LONGSEQUENCES)✨
  • velveth_long(1)simple hashing program (LONGSEQUENCES)✨