XspecT 0.1.2__py3-none-any.whl → 0.2.0__py3-none-any.whl

xspect/BF_v2.py

@@ -1,648 +0,0 @@
-"""Bloomfilter implementation"""
-
-import os
-import csv
-from copy import deepcopy
-import pickle
-import statistics
-from pathlib import Path
-
-
-try:
-    # try with a fast c-implementation ...
-    import mmh3 as mmh3
-except ImportError:
-    # ... otherwise fallback to this module!
-    import pymmh3 as mmh3
-
-from bitarray import bitarray
-from Bio import SeqIO
-from Bio.Seq import Seq
-import h5py
-import xspect.Bootstrap as bs
-from xspect.OXA_Table import OXATable
-
-
-class AbaumanniiBloomfilter:
-    """Bloomfilter that can read FASTA and FASTQ files to assign the given file to a reference-genome"""
-
-    # Implementation of the Bloomfilter Project for Acinetobacter baumannii
-    # Used an customized also for the Bloomfilter Project for Acinetobacter Species Assignment
-    # Variables from the Strain-Typing were used if possible for the Species-Assignment to not over-complicate the Code
-    # Code partly from https://github.com/Phelimb/BIGSI
-
-    clonetypes = 1  # Number of IC's/Species
-    hits_per_filter = [0] * clonetypes  # Hit counter per IC/per Species
-    array_size = 22000000  # Standard arraysize per IC is 22mio for Core-genome
-    hashes = 7  # Number of used Hash-functions
-    k = 20  # length of the k-meres
-    names = [
-        "IC1",
-        "IC2",
-        "IC3",
-        "IC4",
-        "IC5",
-        "IC6",
-        "IC7",
-        "IC8",
-    ]  # names of the IC's
-    number_of_kmeres = 0  # counter of k-meres, will be used to calculate score
-    reads = 1000  # standard read number
-
-    def __init__(self, arraysize):
-        """creates empty matrix"""
-        self.matrix = bitarray(arraysize)
-        self.matrix.setall(False)
-        self.array_size = arraysize
-        self.kmeres = []
-        self.hits_per_filter_kmere = []
-        self.kmer_hits_single = []
-        self.coverage = []
-        self.hit = False
-
-    # Setter
-
-    def set_arraysize(self, new):
-        """changes Arraysize to new input-value, does not recreate matrix"""
-        self.array_size = new
-
-    def set_clonetypes(self, new):
-        """changes number of Clonetypes"""
-        self.clonetypes = new
-        self.hits_per_filter = [0] * self.clonetypes
-
-    def set_hashes(self, new):
-        """Changes number of used hash-functions"""
-        self.hashes = new
-
-    def set_k(self, new):
-        """Changes length of k-meres"""
-        self.k = new
-
-    def set_names(self, new):
-        """Changes Names of Filters, Input must be a List of names"""
-        self.names = new
-
-    def reset_counter(self):
-        """resets counter"""
-        self.number_of_kmeres = 0
-        self.hits_per_filter = [0] * self.clonetypes
-
-    def set_reads(self, new):
-        """Changes number of reads to new value"""
-        self.reads = new
-
-    # Getter
-
-    def get_score(self):
-        """calculates score for all clonetypes
-        Score is #hits / #kmeres"""
-
-        score = []
-
-        # calculates float for each value in [hits per filter]
-        for i in range(self.clonetypes):
-            if self.hits_per_filter[i] == 0:
-                score.append(0.0)
-            else:
-                score.append(
-                    round(
-                        float(self.hits_per_filter[i]) / float(self.number_of_kmeres), 2
-                    )
-                )
-
-        return score
-
-    def get_reads(self):
-        """gets number of reads"""
-        return self.reads
-
-    def get_hits_per_filter(self):
-        """gets Hits per Filter"""
-        return self.hits_per_filter
-
-    def get_kmeres_per_sequence(self):
-        """gets K-mer counter"""
-        # returns number of k-meres per file
-        return self.number_of_kmeres
-
-    def get_names(self):
-        """gets names of filters"""
-        return self.names
-
-    def get_coverage(self):
-        """gets coverage"""
-        return self.coverage
-
-    # File management
-
-    def save_clonetypes(self, path):
-        """saves matrix as a binary file to the input-path"""
-        # saving filters of clonetypes
-
-        # creating file and saving matrix with the bitarray modul
-        with open(path, "wb") as fh:
-            # writing to file with bitarray command
-            self.matrix.tofile(fh)
-
-    def read_clonetypes(self, paths, names):
-        """reads slices from files and concats them to a matrix,
-        paths is list of paths and names is a string list"""
-
-        # Updating parameters
-        self.clonetypes = len(paths)
-        self.names = names
-        self.matrix = bitarray(0)
-        self.number_of_kmeres = 0
-        self.hits_per_filter = [0] * self.clonetypes
-
-        # creating matrix from single filters
-        for path in paths:
-            temp = bitarray()
-
-            with open(path, "rb") as fh:
-                temp.fromfile(fh)
-            self.matrix.extend(temp)
-
-    # Bloomfilter
-
-    def hash(self, kmer):
-        """Hashes given string and returns Positions for the Array"""
-
-        # Empty list for Array positions
-        positions = []
-        # Creating hashes for needed number of hash functions
-        for i in range(self.hashes):
-            # mmh3 takes that string and a seed,
-            # each hash function takes an individual seed
-            # after that, the hash-value will me divided by the array size until
-            # a position in the array is guaranteed
-            positions.append(mmh3.hash(kmer, i) % self.array_size)
-
-        return positions
-
-    def lookup(self, kmer, limit=False):
-        """checks if an element is in the filters, returns list with True/False,
-        takes kmer input string and checks all clonetypes if the k-mer is inside that set of kmers
-        """
-
-        # getting positions
-        positions = self.hash(str(kmer))
-        # control if element is in filter
-        hits = [True] * self.clonetypes
-        self.hit = False
-        # save the individual kmer-hit vector for bootstrapping
-        temp = [0] * self.clonetypes
-
-        for i in range(self.clonetypes):
-            row = i * self.array_size
-            # all 7 Positions are hardcoded, the number of hashes is always(!) 7
-            # if all positions  are True, then hits[i] will also stay True
-            # (i*self.array_size) skips to the same position in the next filter
-            hits[i] = (
-                self.matrix[positions[0] + row]
-                and self.matrix[positions[1] + row]
-                and self.matrix[positions[2] + row]
-                and self.matrix[positions[3] + row]
-                and self.matrix[positions[4] + row]
-                and self.matrix[positions[5] + row]
-                and self.matrix[positions[6] + row]
-            )
-
-            if hits[i]:
-                temp[i] += 1
-                self.hit = True
-                if limit:
-                    if self.table.lookup(self.names[i], kmer):
-                        self.hits_per_filter[i] += 1
-                else:
-                    # Update hit counter
-                    self.hits_per_filter[i] += 1
-        self.kmer_hits_single.append(temp)
-
-    def train(self, kmer, clonetype):
-        """trains specific filter for a k-mer, input is that kmer and the desired Filter"""
-
-        # getting hash Values
-        positions = self.hash(kmer)
-        # changing 0s to 1 in filter
-        for position in positions:
-            # getting position of cell
-            self.matrix[self.array_size * clonetype + position] = True
-
-    def train_sequence(self, filepath, clonetype, quick=False):
-        """trains whole sequence into filter, takes filepath to file and the desired filter as input"""
-        # for each sequence (in multi-FASTA file)
-        if quick:
-            for sequence in SeqIO.parse(filepath, "fasta"):
-                # for each k-mere
-                for i in range(len(sequence.seq) - self.k):
-                    # trains k-mere into filter
-                    self.train(str(sequence.seq[i : i + self.k]), clonetype)
-        else:
-            for sequence in SeqIO.parse(filepath, "fasta"):
-                # for each k-mere
-                # for i in range(len(sequence.seq) - self.k + 1):
-                for i in range(len(sequence.seq) - self.k + 1):
-                    # tests which kmer ist lexicographic greater
-                    kmer = str(sequence.seq[i : i + self.k])
-                    kmer_complement = str(
-                        sequence.seq[i : i + self.k].reverse_complement()
-                    )
-                    # trains k-mere into filter
-                    if kmer > kmer_complement:
-                        self.train(kmer, clonetype)
-                    else:
-                        self.train(kmer_complement, clonetype)
-                    # trains k-mere into filter
-                    # self.train(str(sequence.seq[i: i + self.k]), clonetype)
-                    # testing
-                    # self.train(str(sequence.seq[i: i + self.k].reverse_complement()), clonetype)
-
-    def lookup_txt(self, reads, genus, ext=False, quick=False):
-        """Reading extracted fq-reads"""
-        self.number_of_kmeres = 0
-        self.hits_per_filter = [0] * self.clonetypes
-
-        if quick == 1:
-            # Quick: Non-overlapping k-mers
-            # XspecT-Quick-Mode every 500th kmer
-            for single_read in reads:
-                # r is rest, so all kmers have size k
-                for j in range(0, len(single_read) - self.k, 500):
-                    if "N" in single_read[j : j + self.k]:
-                        continue
-                    self.number_of_kmeres += 1
-                    kmer = str(single_read[j : j + self.k])
-                    kmer_reversed = str(Seq(kmer).reverse_complement())
-                    if kmer > kmer_reversed:
-                        self.lookup(kmer)
-                    else:
-                        self.lookup(kmer_reversed)
-        # XspecT Sequence-Reads every 10th kmer
-        elif quick == 2:
-            for single_read in range(0, len(reads)):
-                hit_counter = 0
-                for j in range(0, len(reads[single_read]) - self.k, 10):
-                    if j == 5 and hit_counter == 0:
-                        break
-                    # updating counter
-                    self.number_of_kmeres += 1
-                    # lookup for kmer
-                    temp = reads[single_read]
-                    kmer = str(temp[j : j + self.k])
-                    kmer_reversed = str(Seq(kmer).reverse_complement())
-                    if kmer > kmer_reversed:
-                        self.lookup(kmer)
-                    else:
-                        self.lookup(kmer_reversed)
-                    if self.hit == True:
-                        hit_counter += 1
-        elif quick == 3:
-            # ClAssT Quick-Mode every 10th kmer
-            for single_read in reads:
-                # r is rest, so all kmers have size k
-                for j in range(0, len(single_read) - self.k, 10):
-                    if "N" in single_read[j : j + self.k]:
-                        continue
-                    self.number_of_kmeres += 1
-                    kmer = str(single_read[j : j + self.k])
-                    kmer_reversed = str(Seq(kmer).reverse_complement())
-                    if kmer > kmer_reversed:
-                        self.lookup(kmer)
-                    else:
-                        self.lookup(kmer_reversed)
-        # metagenome mode
-        elif quick == 4:
-            print("Stage 1")
-            # tracker = SummaryTracker()
-            counter = 0
-            reads_classified = {}
-            names = []
-            predictions = []
-            file_name = "Filter" + genus + ".txt"
-            names_path = Path(os.getcwd()) / "filter" / "species_names" / file_name
-            with open(names_path, "rb") as fp:
-                names = pickle.load(fp)
-            print("Stage 2")
-            for read in reads:
-                # since we do indv. contig classifications we need to reset the BF vars
-                self.kmer_hits_single = []
-                self.number_of_kmeres = 0
-                self.hits_per_filter = [0] * self.clonetypes
-                for kmer in read:
-                    counter += 1
-                    # lookup for kmer, use lexikographical smaller kmer
-                    self.number_of_kmeres += 1
-                    kmer_reversed = str(Seq(kmer).reverse_complement())
-                    if kmer > kmer_reversed:
-                        self.lookup(kmer)
-                    else:
-                        self.lookup(kmer_reversed)
-                score = self.get_score()
-                score_edit = [str(x) for x in score]
-                score_edit = ",".join(score_edit)
-                # making prediction
-                index_result = max(range(len(score)), key=score.__getitem__)
-                prediction = names[index_result]
-                predictions.append(prediction)
-                # skip ambiguous contigs
-                if max(score) == sorted(score)[-2]:
-                    continue
-                # bootstrapping
-                bootstrap_n = 100
-                samples = bs.bootstrap(
-                    self.kmer_hits_single, self.number_of_kmeres, bootstrap_n
-                )
-                sample_scores = bs.bootstrap_scores(
-                    samples, self.number_of_kmeres, self.clonetypes
-                )
-                bootstrap_score = 0
-                bootstrap_predictions = []
-                for i in range(len(sample_scores)):
-                    # skip ambiguous contigs (species with same score)
-                    if max(sample_scores[i]) != sorted(sample_scores[i])[-2]:
-                        bootstrap_predictions.append(
-                            names[
-                                max(
-                                    range(len(sample_scores[i])),
-                                    key=sample_scores[i].__getitem__,
-                                )
-                            ]
-                        )
-                        if (
-                            max(
-                                range(len(sample_scores[i])),
-                                key=sample_scores[i].__getitem__,
-                            )
-                            == index_result
-                        ):
-                            bootstrap_score += 1
-                    else:
-                        continue
-                bootstrap_score = bootstrap_score / bootstrap_n
-                # bootstrap_score = 1
-
-                if ("A." + prediction) not in reads_classified:
-                    # Value 5 war vohrer = read
-                    reads_classified["A." + prediction] = [
-                        [max(score)],
-                        1,
-                        [len(read)],
-                        sorted(score)[-2] / max(score),
-                        [bootstrap_score],
-                        None,
-                        None,
-                    ]
-                else:
-                    reads_classified["A." + prediction][0] += [max(score)]
-                    reads_classified["A." + prediction][1] += 1
-                    reads_classified["A." + prediction][2] += [len(read)]
-                    reads_classified["A." + prediction][3] += sorted(score)[-2] / max(
-                        score
-                    )
-                    reads_classified["A." + prediction][4] += [bootstrap_score]
-                    # reads_classified["A." + prediction][5] += None
-                # tracker.print_diff()
-            # not ready yet
-            """for prediction in reads_classified:
-                kmers = reads_classified[prediction][5]
-                # Strip "A."
-                prediction = prediction[2:]
-                # kmer mapping to genome, start by loading the kmer_dict in
-                path_pos = "filter\kmer_positions\Acinetobacter\\" + prediction + "_positions.txt"
-                # delete later
-                path_posv2 = "filter\kmer_positions\Acinetobacter\\" + prediction + "_complete_positions.txt"
-                # cluster kmers to contigs
-                # delete try later
-                start_dict = time.time()
-                try:
-                    with open(path_pos, 'rb') as fp:
-                        kmer_dict = pickle.load(fp)
-                except:
-                    with open(path_posv2, 'rb') as fp:
-                        kmer_dict = pickle.load(fp)
-                end_dict = time.time()
-                needed_dict = round(end_dict - start_dict, 2)
-                print("Time needed to load kmer_dict in: ", needed_dict)
-                contig_amounts_distances = bs.cluster_kmers(kmers, kmer_dict)
-                reads_classified["A." + prediction][6] = contig_amounts_distances"""
-
-            print("Stage 3")
-            # print results
-            for key, value in reads_classified.items():
-                number_of_contigs = value[1]
-                # save results
-                results_clustering = [
-                    [
-                        key
-                        + ","
-                        + str(statistics.median(value[0]))
-                        + ","
-                        + str(number_of_contigs),
-                        str(statistics.median(value[2]))
-                        + ","
-                        + str(round(value[3] / number_of_contigs, 2))
-                        + ","
-                        + str(statistics.median(value[4]))
-                        + ","
-                        + str(value[6]),
-                    ]
-                ]
-                # with open(r'Results/XspecT_mini_csv/Results_Clustering.csv', 'a', newline='') as file:
-                # writer = csv.writer(file)
-                # writer.writerows(results_clustering)
-                # Score Median
-                value[0] = statistics.median(value[0])
-                # Number of Contigs
-                value[1] = number_of_contigs
-                # Contig-Length Median
-                value[2] = statistics.median(value[2])
-                # Uniqueness
-                value[3] = round(1 - (value[3] / number_of_contigs), 2)
-                # Bootstrap Median
-                value[4] = statistics.median(value[4])
-                # value[6] = "Clusters: " + str(value[6])
-                reads_classified[key] = value
-            print("Stage 4")
-            print("Types of return vars: ", type(reads_classified), type(predictions))
-            return reads_classified, predictions
-
-        else:
-            for single_read in reads:
-                for j in range(len(single_read) - self.k + 1):
-                    # updating counter
-                    self.number_of_kmeres += 1
-                    # lookup for kmer
-                    kmer = str(single_read[j : j + self.k])
-                    kmer_reversed = str(Seq(kmer).reverse_complement())
-                    if kmer > kmer_reversed:
-                        self.lookup(kmer)
-                    else:
-                        self.lookup(kmer_reversed)
-
-    def cleanup(self):
-        """deletes matrix"""
-        self.matrix = None
-
-    def lookup_oxa(self, reads, ext):
-        """Looks for OXA Genes: Extension (ext) selects the fq-seach or fasta-search mode"""
-        self.table = OXATable()
-        self.table.read_dic(r"filter/OXAs_dict/oxa_dict.txt")
-        if ext == "fq":
-            # fq mode
-            coordinates_forward = []
-            coordinates_reversed = []
-            for i in range(len(reads)):
-                # going through all reads, discarding those who don't get any hits with 3 test k-meres
-
-                # Building 3 test-kmeres: first, last, and middle
-                k1 = reads[i][0 : self.k]  # first k-mer
-                k2 = reads[i][len(reads[i]) - self.k :]  # last k-mer
-                mid = len(reads[i]) // 2
-                k3 = reads[i][mid : mid + self.k]  # k-mer in middle
-
-                # Taking sum of list as reference, if sum has not increased after testing those 3 kmeres,
-                # then the read won't be tested further
-                hit_sum = sum(self.hits_per_filter)
-                copy = deepcopy(self.hits_per_filter)
-                self.lookup(k1, True)
-                self.lookup(k2, True)
-                self.lookup(k3, True)
-
-                # needs at least 2 of 3 hits to continue with read
-                if (sum(self.hits_per_filter) - hit_sum) > 1:
-                    for j in range(1, len(reads[i]) - 1 - self.k + 1):
-                        # Skipping first, last and middle k-mer
-                        if j != mid:
-                            self.lookup(reads[i][j : j + self.k], True)
-                            self.number_of_kmeres += 1
-
-                else:
-                    # resetting hit counter
-                    self.hits_per_filter = copy
-
-                # same, but with reverse complement
-                reads[i] = Seq(reads[i])
-                reads[i] = reads[i].reverse_complement()
-                k1 = reads[i][0 : self.k]  # first k-mer
-                k2 = reads[i][len(reads[i]) - self.k :]  # last k-mer
-                mid = len(reads[i]) // 2
-                k3 = reads[i][mid : mid + self.k]  # k-mer in middle
-
-                # Taking sum of list as reference, if sum has not increased after testing those 3 kmeres,
-                # then the read won't be tested further
-                hit_sum = sum(self.hits_per_filter)
-                copy = deepcopy(self.hits_per_filter)
-                self.lookup(k1, True)
-                self.lookup(k2, True)
-                self.lookup(k3, True)
-
-                # needs at least 2 of 3 hits to continue with read
-                if (sum(self.hits_per_filter) - hit_sum) > 1:
-                    for j in range(1, len(reads[i]) - 1 - self.k + 1):
-                        # Skipping first, last and middle k-mer
-                        if j != mid:
-                            self.lookup(reads[i][j : j + self.k], True)
-                            self.number_of_kmeres += 1
-
-                else:
-                    # resetting hit counter
-                    self.hits_per_filter = copy
-
-        else:
-            # fasta mode
-            # Altes testen mit Genom, hits per filter ausgeben lassen
-            # self.oxa_search_genomes(reads)
-            # self.oxa_search_genomes_v2(reads)
-            coordinates_forward = self.oxa_search_genomes_v3(reads)
-            reads_reversed = []
-            for r in range(len(reads)):
-                # building reverse complement
-                reads_reversed.append(Seq(reads[r]))
-                reads_reversed[r] = reads_reversed[r].reverse_complement()
-            # lookup reverse complement
-            # self.oxa_search_genomes(reads)
-            # self.oxa_search_genomes_v2(reads)
-            coordinates_reversed = self.oxa_search_genomes_v3(reads_reversed)
-
-        # cleanup
-        reads = None
-        self.table.cleanup()
-        return coordinates_forward, coordinates_reversed
-
-    def oxa_search_genomes_v3(self, genome):
-        coordinates = []
-        for i in genome:
-            j = 0
-            success = False
-            while j < len(i):
-                hits = sum(self.hits_per_filter)
-                kmer = i[j : j + self.k]
-                self.lookup(kmer, True)
-                if success == False:
-                    if sum(self.hits_per_filter) > hits:
-                        counter = 0
-                        coordinates.append([j])
-                        # 1024 (longest oxa-gene) - 19
-                        for n in range(j - 249, j + 1005, 1):
-                            if 0 <= j < len(i):
-                                hits_per_filter_copy = self.hits_per_filter[:]
-                                kmer = i[n : n + self.k]
-                                self.lookup(kmer, True)
-                                if hits_per_filter_copy != self.hits_per_filter:
-                                    counter += 1
-                        if counter > 300:
-                            coordinates[-1].append(j + 1005)
-                        else:
-                            coordinates.pop()
-                        j += 1005
-                        success = True
-                    else:
-                        # j += 20
-                        j += 250
-                        success = False
-                else:
-                    if sum(self.hits_per_filter) > hits:
-                        coordinates.append([j])
-                        counter = 0
-                        for n in range(j, j + 1005, 1):
-                            if 0 <= j < len(i):
-                                kmer = i[n : n + self.k]
-                                hits_per_filter_copy = self.hits_per_filter[:]
-                                self.lookup(kmer, True)
-                                if hits_per_filter_copy != self.hits_per_filter:
-                                    counter += 1
-                        if counter > 300:
-                            coordinates[-1].append(j + 1005)
-                        else:
-                            coordinates.pop()
-                        j += 1005
-                        success = True
-                    else:
-                        j += 250
-                        success = False
-        # if len(coordinates) > 0:
-        # print("Coordinates: ", coordinates)
-        return coordinates
-
-    def get_oxa_score(self):
-        """Returning hits per OXA/kmere in OXA-filter"""
-        table = OXATable()
-        counter = table.get_counter()
-        score = []
-        # calculates float for each value in [hits per filter]
-        for i in range(self.clonetypes):
-            if self.hits_per_filter[i] == 0:
-                score.append(0.0)
-            else:
-                score.append(
-                    round(
-                        float(self.hits_per_filter[i]) / float(counter[self.names[i]]),
-                        2,
-                    )
-                )
-                # print(self.hits_per_filter[i], counter[self.names[i]])
-        # reset hits per filter
-        self.hits_per_filter = [0] * self.clonetypes
-        return score

xspect/Bootstrap.py

@@ -1,29 +0,0 @@
-import random
-from numpy import array
-from numpy import sum
-
-
-def bootstrap(data, sample_amount, size):
-    samples = []
-    for i in range(size):
-        sample = []
-        for j in range(sample_amount):
-            sample.append(random.choice(data))
-        sample = array(sample)
-        temp = sum(sample, 0)
-        samples.append(list(temp))
-    return samples
-
-
-def bootstrap_scores(samples, number_of_kmeres, number_of_filters):
-    scores = []
-    # calculates float for each value in [hits per filter]
-    for i in range(len(samples)):
-        score = []
-        for j in range(number_of_filters):
-            if samples[i][j] == 0:
-                score.append(0.0)
-            else:
-                score.append(round(float(samples[i][j]) / float(number_of_kmeres), 2))
-        scores.append(score)
-    return scores