def reads_generator(fasta_file, read_length, k):
    'This function simulates the reads generation from a fasta file with a coverage not less than 50.\n    It will return a list of tuples. First element in tuple is read ID and second the sequence.\n    \n    Key Arguments:\n        fasta_file -- fasta file.\n        read_length -- size of reads.\n    '
    reads_list = []
    overlap = (k - 1)
    (input_header, input_seq) = read_fasta(fasta_file)[0]
    n = len(input_seq)
    for i in range(0, (n - overlap), (read_length - overlap)):
        read_seq = input_seq[i:(i + read_length)]
        reads_list.append(read_seq)
    return [('{}_{}'.format(input_header, i), read) for (i, read) in enumerate(reads_list)]
This function simulates the reads generation from a fasta file with a coverage not less than 50.
It will return a list of tuples. First element in tuple is read ID and second the sequence.

Key Arguments:
    fasta_file -- fasta file.
    read_length -- size of reads.
def reads_generator(fasta_file, read_length, k):
    'This function simulates the reads generation from a fasta file with a coverage not less than 50.\n    It will return a list of tuples. First element in tuple is read ID and second the sequence.\n    \n    Key Arguments:\n        fasta_file -- fasta file.\n        read_length -- size of reads.\n    '
    reads_list = []
    overlap = (k - 1)
    (input_header, input_seq) = read_fasta(fasta_file)[0]
    n = len(input_seq)
    for i in range(0, (n - overlap), (read_length - overlap)):
        read_seq = input_seq[i:(i + read_length)]
        reads_list.append(read_seq)
    return [('{}_{}'.format(input_header, i), read) for (i, read) in enumerate(reads_list)]