Advice on best freeware to assemble a short 'toy' sequence from 18 very short unpaired reads via De Brujin and/or Greedy graph

Question

[gs376]

I am required to assemble (de novo) the below very short 'toy' reads into contigs.

If someone could recommend the best freeware for assembling via Greedy method, Overlap Consensus-layout and/or K-mer graph (de brujin graph) it would be greatly appreciated.

I have attempted to use SPAdes, however, have encountered issues due to what I presume is a case of the software not being designed to handle so few and such short reads.

The 'toy' reads are as follows:

>1
TATTATTACAGTCCCGCAAG
>2
ATTATTATTATTATTATTAT
>3
TTATTATTATTATTATTATT
>4
TATTATTATTATTATTATTA
>5
TATTATTATTATTATTATTA
>6
ATTATTATTATTATTATTAT
>7
CATTATTATTATTATTATTA
>8
AGATTCAGCTCGATCCATGA
>9
CAGATTCAGCTCGATCCATT
>10
TTATTACAGTCCCGCAAGCA
>11
TCGATCCATTATTATTATTA
>12
ATTATTATTATTATTATTAT
>13
GATCCATTATTATTATTATT
>14
TATTATTACAGTCCCGCAAG
>15
ATTATTATTATTATTACAGT
>16
TTATTATTACAGTCCCGCAA
>17
ATTATTATTATTATTATTAT
>18
TATTATTATTATTACAGTCC

I greatly appreciate any advice you could offer

[GenoMax]

You could give tadpole.sh from BBMap suite a try instead of SPAdes.

Note: Did you just make a new account to post this question under a different name?